/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/divbin2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 14:45:45,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 14:45:45,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 14:45:45,947 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 14:45:45,948 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 14:45:45,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 14:45:45,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 14:45:45,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 14:45:45,955 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 14:45:45,960 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 14:45:45,961 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 14:45:45,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 14:45:45,962 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 14:45:45,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 14:45:45,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 14:45:45,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 14:45:45,966 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 14:45:45,967 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 14:45:45,971 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 14:45:45,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 14:45:45,976 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 14:45:45,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 14:45:45,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 14:45:45,979 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 14:45:45,980 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 14:45:45,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 14:45:45,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 14:45:45,982 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 14:45:45,983 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 14:45:45,983 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 14:45:45,984 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 14:45:45,984 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 14:45:45,985 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 14:45:45,986 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 14:45:45,986 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 14:45:45,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 14:45:45,987 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 14:45:45,987 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 14:45:45,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 14:45:45,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 14:45:45,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 14:45:45,989 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 14:45:45,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 14:45:46,015 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 14:45:46,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 14:45:46,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 14:45:46,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 14:45:46,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 14:45:46,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 14:45:46,016 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 14:45:46,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 14:45:46,017 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 14:45:46,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 14:45:46,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 14:45:46,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 14:45:46,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 14:45:46,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 14:45:46,018 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 14:45:46,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 14:45:46,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 14:45:46,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 14:45:46,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:45:46,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 14:45:46,019 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 14:45:46,019 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 14:45:46,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 14:45:46,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 14:45:46,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 14:45:46,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 14:45:46,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 14:45:46,220 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 14:45:46,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-14 14:45:46,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfe5ff4/77ab59b841bb4e3aa65f4272374c72bb/FLAG5a421a0f0 [2022-04-14 14:45:46,630 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 14:45:46,630 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i [2022-04-14 14:45:46,640 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfe5ff4/77ab59b841bb4e3aa65f4272374c72bb/FLAG5a421a0f0 [2022-04-14 14:45:46,654 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3edfe5ff4/77ab59b841bb4e3aa65f4272374c72bb [2022-04-14 14:45:46,656 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 14:45:46,657 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 14:45:46,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 14:45:46,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 14:45:46,661 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 14:45:46,664 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,665 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b561cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46, skipping insertion in model container [2022-04-14 14:45:46,665 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 14:45:46,679 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 14:45:46,811 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i[951,964] [2022-04-14 14:45:46,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:45:46,839 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 14:45:46,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/divbin2.i[951,964] [2022-04-14 14:45:46,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 14:45:46,870 INFO L208 MainTranslator]: Completed translation [2022-04-14 14:45:46,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46 WrapperNode [2022-04-14 14:45:46,871 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 14:45:46,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 14:45:46,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 14:45:46,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 14:45:46,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,893 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 14:45:46,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 14:45:46,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 14:45:46,899 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 14:45:46,902 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (1/1) ... [2022-04-14 14:45:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 14:45:46,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:46,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-14 14:45:46,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-14 14:45:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 14:45:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 14:45:46,954 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 14:45:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 14:45:46,955 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 14:45:46,956 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 14:45:46,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 14:45:46,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 14:45:47,019 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 14:45:47,020 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 14:45:47,146 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 14:45:47,150 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 14:45:47,150 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 14:45:47,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:45:47 BoogieIcfgContainer [2022-04-14 14:45:47,151 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 14:45:47,152 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 14:45:47,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 14:45:47,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 14:45:47,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 02:45:46" (1/3) ... [2022-04-14 14:45:47,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a213ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:45:47, skipping insertion in model container [2022-04-14 14:45:47,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 02:45:46" (2/3) ... [2022-04-14 14:45:47,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a213ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 02:45:47, skipping insertion in model container [2022-04-14 14:45:47,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 02:45:47" (3/3) ... [2022-04-14 14:45:47,156 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2.i [2022-04-14 14:45:47,158 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 14:45:47,158 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 14:45:47,204 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 14:45:47,210 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-14 14:45:47,210 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 14:45:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 14:45:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 14:45:47,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:47,228 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:47,228 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1443343444, now seen corresponding path program 1 times [2022-04-14 14:45:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:47,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808760633] [2022-04-14 14:45:47,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:47,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:47,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 14:45:47,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:47,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-14 14:45:47,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-14 14:45:47,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-14 14:45:47,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 14:45:47,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {27#true} is VALID [2022-04-14 14:45:47,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-14 14:45:47,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #80#return; {27#true} is VALID [2022-04-14 14:45:47,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2022-04-14 14:45:47,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {27#true} is VALID [2022-04-14 14:45:47,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume false; {28#false} is VALID [2022-04-14 14:45:47,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-14 14:45:47,386 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-14 14:45:47,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-14 14:45:47,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-14 14:45:47,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-14 14:45:47,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:45:47,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:47,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808760633] [2022-04-14 14:45:47,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808760633] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:45:47,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:45:47,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 14:45:47,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013741895] [2022-04-14 14:45:47,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:45:47,392 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:45:47,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:47,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:47,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:47,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 14:45:47,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:47,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 14:45:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:45:47,432 INFO L87 Difference]: Start difference. First operand has 24 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:47,522 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2022-04-14 14:45:47,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 14:45:47,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 14:45:47,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:47,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-14 14:45:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2022-04-14 14:45:47,536 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2022-04-14 14:45:47,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:47,634 INFO L225 Difference]: With dead ends: 40 [2022-04-14 14:45:47,634 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 14:45:47,636 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:45:47,637 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:47,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:45:47,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 14:45:47,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-14 14:45:47,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:47,655 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:47,656 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:47,656 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:47,658 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-14 14:45:47,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 14:45:47,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:47,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:47,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 14:45:47,659 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 14:45:47,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:47,661 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-04-14 14:45:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 14:45:47,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:47,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:47,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:47,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:47,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-04-14 14:45:47,664 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-04-14 14:45:47,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:47,664 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-04-14 14:45:47,664 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:47,664 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-04-14 14:45:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 14:45:47,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:47,665 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:47,665 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 14:45:47,665 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1532818659, now seen corresponding path program 1 times [2022-04-14 14:45:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:47,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725476290] [2022-04-14 14:45:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:47,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:47,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:45:47,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [577928651] [2022-04-14 14:45:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:47,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:47,707 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:47,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-14 14:45:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:47,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 14:45:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:47,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:45:48,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {151#true} call ULTIMATE.init(); {151#true} is VALID [2022-04-14 14:45:48,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {151#true} is VALID [2022-04-14 14:45:48,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume true; {151#true} is VALID [2022-04-14 14:45:48,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151#true} {151#true} #80#return; {151#true} is VALID [2022-04-14 14:45:48,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {151#true} call #t~ret2 := main(); {151#true} is VALID [2022-04-14 14:45:48,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {171#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {178#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {178#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {178#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,098 INFO L272 TraceCheckUtils]: 9: Hoare triple {178#(and (= main_~b~0 1) (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {185#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:45:48,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {185#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {189#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:48,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {189#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {152#false} is VALID [2022-04-14 14:45:48,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {152#false} assume !false; {152#false} is VALID [2022-04-14 14:45:48,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:45:48,102 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:45:48,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725476290] [2022-04-14 14:45:48,102 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:45:48,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577928651] [2022-04-14 14:45:48,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577928651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:45:48,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:45:48,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 14:45:48,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329539250] [2022-04-14 14:45:48,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:45:48,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 14:45:48,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:48,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:48,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:48,120 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:45:48,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:48,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:45:48,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-14 14:45:48,123 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:48,263 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-14 14:45:48,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:45:48,263 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 14:45:48,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:48,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:48,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-14 14:45:48,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:48,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-14 14:45:48,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-14 14:45:48,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:48,309 INFO L225 Difference]: With dead ends: 31 [2022-04-14 14:45:48,309 INFO L226 Difference]: Without dead ends: 28 [2022-04-14 14:45:48,310 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-14 14:45:48,312 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:48,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 56 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:45:48,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-14 14:45:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-14 14:45:48,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:48,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:48,321 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:48,321 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:48,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:48,324 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-14 14:45:48,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-14 14:45:48,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:48,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:48,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-14 14:45:48,325 INFO L87 Difference]: Start difference. First operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 28 states. [2022-04-14 14:45:48,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:48,327 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-14 14:45:48,327 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-14 14:45:48,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:48,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:48,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:48,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:48,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:48,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-14 14:45:48,333 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 13 [2022-04-14 14:45:48,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:48,333 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-14 14:45:48,334 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-14 14:45:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-14 14:45:48,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:48,334 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:48,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-14 14:45:48,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:48,542 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:48,543 INFO L85 PathProgramCache]: Analyzing trace with hash 909386808, now seen corresponding path program 1 times [2022-04-14 14:45:48,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:48,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989956749] [2022-04-14 14:45:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:48,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:45:48,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1981778319] [2022-04-14 14:45:48,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:48,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:48,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:48,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-14 14:45:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:48,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-14 14:45:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:48,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:45:48,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2022-04-14 14:45:48,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {335#true} is VALID [2022-04-14 14:45:48,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume true; {335#true} is VALID [2022-04-14 14:45:48,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} #80#return; {335#true} is VALID [2022-04-14 14:45:48,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {335#true} call #t~ret2 := main(); {335#true} is VALID [2022-04-14 14:45:48,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {355#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 14:45:48,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {362#(and (= main_~A~0 main_~r~0) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:45:48,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:48,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {336#false} is VALID [2022-04-14 14:45:48,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-04-14 14:45:48,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:45:48,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:45:49,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {336#false} assume !false; {336#false} is VALID [2022-04-14 14:45:49,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {336#false} is VALID [2022-04-14 14:45:49,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:49,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 14:45:49,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 14:45:49,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 14:45:49,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 14:45:49,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {408#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {395#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 14:45:49,115 INFO L290 TraceCheckUtils]: 6: Hoare triple {408#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !false; {408#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 14:45:49,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {335#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {408#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 14:45:49,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {335#true} call #t~ret2 := main(); {335#true} is VALID [2022-04-14 14:45:49,116 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {335#true} {335#true} #80#return; {335#true} is VALID [2022-04-14 14:45:49,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {335#true} assume true; {335#true} is VALID [2022-04-14 14:45:49,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {335#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {335#true} is VALID [2022-04-14 14:45:49,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {335#true} call ULTIMATE.init(); {335#true} is VALID [2022-04-14 14:45:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:45:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989956749] [2022-04-14 14:45:49,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:45:49,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981778319] [2022-04-14 14:45:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981778319] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 14:45:49,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 14:45:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2022-04-14 14:45:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080671875] [2022-04-14 14:45:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:45:49,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:45:49,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:49,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:49,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:49,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 14:45:49,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:49,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 14:45:49,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-04-14 14:45:49,142 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:49,216 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-14 14:45:49,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 14:45:49,216 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-14 14:45:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:49,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-14 14:45:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2022-04-14 14:45:49,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2022-04-14 14:45:50,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:50,995 INFO L225 Difference]: With dead ends: 36 [2022-04-14 14:45:50,995 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 14:45:50,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:45:50,996 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:50,997 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-04-14 14:45:50,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 14:45:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 14:45:51,004 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:51,004 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 14:45:51,004 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 14:45:51,004 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 14:45:51,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:51,006 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 14:45:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 14:45:51,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:51,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:51,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 14:45:51,007 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 14:45:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:51,008 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 14:45:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 14:45:51,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:51,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:51,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:51,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 14:45:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 14:45:51,010 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 15 [2022-04-14 14:45:51,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:51,010 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 14:45:51,010 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 14:45:51,010 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 14:45:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 14:45:51,011 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:51,011 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:51,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 14:45:51,226 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-14 14:45:51,226 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:51,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:51,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1729767853, now seen corresponding path program 1 times [2022-04-14 14:45:51,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:51,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146934121] [2022-04-14 14:45:51,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:51,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:51,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:45:51,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1043145492] [2022-04-14 14:45:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:51,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:51,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:51,241 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:51,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 14:45:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:51,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 14:45:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:51,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:45:51,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {598#true} call ULTIMATE.init(); {598#true} is VALID [2022-04-14 14:45:51,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {598#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {598#true} is VALID [2022-04-14 14:45:51,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-14 14:45:51,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {598#true} {598#true} #80#return; {598#true} is VALID [2022-04-14 14:45:51,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {598#true} call #t~ret2 := main(); {598#true} is VALID [2022-04-14 14:45:51,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {598#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 14:45:51,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 14:45:51,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 14:45:51,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 14:45:51,335 INFO L272 TraceCheckUtils]: 9: Hoare triple {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {598#true} is VALID [2022-04-14 14:45:51,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {598#true} ~cond := #in~cond; {598#true} is VALID [2022-04-14 14:45:51,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#true} assume !(0 == ~cond); {598#true} is VALID [2022-04-14 14:45:51,336 INFO L290 TraceCheckUtils]: 12: Hoare triple {598#true} assume true; {598#true} is VALID [2022-04-14 14:45:51,336 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {598#true} {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #76#return; {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 14:45:51,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {618#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {599#false} is VALID [2022-04-14 14:45:51,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {599#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {599#false} is VALID [2022-04-14 14:45:51,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#false} assume !false; {599#false} is VALID [2022-04-14 14:45:51,337 INFO L272 TraceCheckUtils]: 17: Hoare triple {599#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {599#false} is VALID [2022-04-14 14:45:51,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {599#false} ~cond := #in~cond; {599#false} is VALID [2022-04-14 14:45:51,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {599#false} assume 0 == ~cond; {599#false} is VALID [2022-04-14 14:45:51,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {599#false} assume !false; {599#false} is VALID [2022-04-14 14:45:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 14:45:51,338 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 14:45:51,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146934121] [2022-04-14 14:45:51,338 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:45:51,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043145492] [2022-04-14 14:45:51,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043145492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 14:45:51,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 14:45:51,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 14:45:51,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738503015] [2022-04-14 14:45:51,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 14:45:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 14:45:51,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:51,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:51,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:51,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 14:45:51,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:51,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 14:45:51,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:45:51,356 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:51,406 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-14 14:45:51,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 14:45:51,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-14 14:45:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:51,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:51,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-14 14:45:51,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-04-14 14:45:51,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-04-14 14:45:51,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:51,446 INFO L225 Difference]: With dead ends: 45 [2022-04-14 14:45:51,446 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 14:45:51,446 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 14:45:51,447 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:51,447 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 14:45:51,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 14:45:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-14 14:45:51,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:51,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:51,452 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:51,452 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:51,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:51,453 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 14:45:51,453 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-14 14:45:51,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:51,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:51,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 14:45:51,454 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 14:45:51,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:51,455 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-04-14 14:45:51,455 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-14 14:45:51,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:51,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:51,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:51,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:51,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:51,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-04-14 14:45:51,456 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2022-04-14 14:45:51,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:51,456 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-04-14 14:45:51,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 14:45:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-04-14 14:45:51,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 14:45:51,457 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:51,457 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:51,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 14:45:51,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:51,673 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:51,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:51,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1175156077, now seen corresponding path program 1 times [2022-04-14 14:45:51,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:51,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10707205] [2022-04-14 14:45:51,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:51,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:51,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:45:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101489798] [2022-04-14 14:45:51,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:51,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:51,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:51,686 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:51,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 14:45:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:51,713 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 14:45:51,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 14:45:51,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 14:45:51,877 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-14 14:45:51,877 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {816#true} is VALID [2022-04-14 14:45:51,877 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #80#return; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret2 := main(); {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {816#true} is VALID [2022-04-14 14:45:51,878 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:51,878 INFO L272 TraceCheckUtils]: 11: Hoare triple {816#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {816#true} is VALID [2022-04-14 14:45:51,880 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} ~cond := #in~cond; {857#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 14:45:51,880 INFO L290 TraceCheckUtils]: 13: Hoare triple {857#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:45:51,880 INFO L290 TraceCheckUtils]: 14: Hoare triple {861#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:45:51,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {861#(not (= |__VERIFIER_assert_#in~cond| 0))} {816#true} #76#return; {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 14:45:51,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 14:45:51,882 INFO L272 TraceCheckUtils]: 17: Hoare triple {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {875#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-14 14:45:51,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {875#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {879#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-14 14:45:51,883 INFO L290 TraceCheckUtils]: 19: Hoare triple {879#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {817#false} is VALID [2022-04-14 14:45:51,883 INFO L290 TraceCheckUtils]: 20: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-14 14:45:51,883 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 14:45:51,883 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 14:45:52,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {817#false} assume !false; {817#false} is VALID [2022-04-14 14:45:52,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {889#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {817#false} is VALID [2022-04-14 14:45:52,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {861#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {889#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:45:52,652 INFO L272 TraceCheckUtils]: 17: Hoare triple {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:45:52,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 14:45:52,653 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {861#(not (= |__VERIFIER_assert_#in~cond| 0))} {816#true} #76#return; {868#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 14:45:52,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {861#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:45:52,654 INFO L290 TraceCheckUtils]: 13: Hoare triple {911#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {861#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 14:45:52,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {816#true} ~cond := #in~cond; {911#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 14:45:52,654 INFO L272 TraceCheckUtils]: 11: Hoare triple {816#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {816#true} is VALID [2022-04-14 14:45:52,654 INFO L290 TraceCheckUtils]: 10: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {816#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {816#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {816#true} assume !false; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {816#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {816#true} call #t~ret2 := main(); {816#true} is VALID [2022-04-14 14:45:52,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {816#true} {816#true} #80#return; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {816#true} assume true; {816#true} is VALID [2022-04-14 14:45:52,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {816#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2); {816#true} is VALID [2022-04-14 14:45:52,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {816#true} call ULTIMATE.init(); {816#true} is VALID [2022-04-14 14:45:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 14:45:52,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 14:45:52,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10707205] [2022-04-14 14:45:52,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 14:45:52,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101489798] [2022-04-14 14:45:52,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101489798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 14:45:52,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 14:45:52,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-14 14:45:52,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833022032] [2022-04-14 14:45:52,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 14:45:52,657 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 14:45:52,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 14:45:52,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 14:45:52,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:52,673 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 14:45:52,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 14:45:52,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 14:45:52,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 14:45:52,674 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 14:45:54,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 14:45:55,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:55,002 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 14:45:55,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 14:45:55,003 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 14:45:55,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 14:45:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 14:45:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-14 14:45:55,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 14:45:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-14 14:45:55,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-14 14:45:55,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 14:45:55,055 INFO L225 Difference]: With dead ends: 33 [2022-04-14 14:45:55,055 INFO L226 Difference]: Without dead ends: 26 [2022-04-14 14:45:55,055 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-14 14:45:55,056 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-14 14:45:55,056 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 68 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-14 14:45:55,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-14 14:45:55,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-04-14 14:45:55,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 14:45:55,060 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:55,060 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:55,060 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:55,061 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-14 14:45:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-14 14:45:55,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:55,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:55,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-14 14:45:55,061 INFO L87 Difference]: Start difference. First operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 26 states. [2022-04-14 14:45:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 14:45:55,062 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-14 14:45:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-14 14:45:55,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 14:45:55,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 14:45:55,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 14:45:55,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 14:45:55,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 14:45:55,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-14 14:45:55,063 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 21 [2022-04-14 14:45:55,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 14:45:55,063 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-14 14:45:55,064 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 14:45:55,064 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-14 14:45:55,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 14:45:55,064 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 14:45:55,064 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 14:45:55,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-14 14:45:55,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:55,265 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 14:45:55,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 14:45:55,265 INFO L85 PathProgramCache]: Analyzing trace with hash 700053448, now seen corresponding path program 1 times [2022-04-14 14:45:55,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 14:45:55,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729799361] [2022-04-14 14:45:55,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:55,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 14:45:55,275 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 14:45:55,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1509985607] [2022-04-14 14:45:55,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 14:45:55,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 14:45:55,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 14:45:55,276 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 14:45:55,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process