/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-scaling/egcd3-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:01:36,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:01:36,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:01:36,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:01:36,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:01:36,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:01:36,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:01:36,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:01:36,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:01:36,249 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:01:36,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:01:36,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:01:36,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:01:36,252 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:01:36,253 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:01:36,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:01:36,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:01:36,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:01:36,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:01:36,261 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:01:36,262 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:01:36,263 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:01:36,264 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:01:36,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:01:36,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:01:36,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:01:36,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:01:36,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:01:36,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:01:36,271 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:01:36,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:01:36,272 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:01:36,274 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:01:36,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:01:36,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:01:36,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:01:36,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:01:36,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:01:36,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:01:36,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:01:36,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:01:36,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:01:36,278 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 16:01:36,300 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:01:36,300 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:01:36,301 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:01:36,301 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:01:36,301 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:01:36,301 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:01:36,301 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:01:36,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:01:36,302 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:01:36,302 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:01:36,302 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:01:36,302 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:01:36,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:01:36,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:01:36,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:01:36,303 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:01:36,303 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:01:36,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:01:36,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:01:36,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:01:36,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:01:36,305 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 16:01:36,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:01:36,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:01:36,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:01:36,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:01:36,463 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:01:36,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-04-14 16:01:36,544 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b504d4f2/0c2b99791e1b492491d1100c8000b033/FLAGcfc611b49 [2022-04-14 16:01:36,870 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:01:36,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound100.c [2022-04-14 16:01:36,879 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b504d4f2/0c2b99791e1b492491d1100c8000b033/FLAGcfc611b49 [2022-04-14 16:01:36,890 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b504d4f2/0c2b99791e1b492491d1100c8000b033 [2022-04-14 16:01:36,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:01:36,893 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:01:36,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:01:36,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:01:36,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:01:36,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:01:36" (1/1) ... [2022-04-14 16:01:36,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67aaad3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:36, skipping insertion in model container [2022-04-14 16:01:36,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:01:36" (1/1) ... [2022-04-14 16:01:36,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:01:36,913 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:01:37,054 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-scaling/egcd3-ll_unwindbound100.c[490,503] [2022-04-14 16:01:37,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:01:37,088 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:01:37,100 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-scaling/egcd3-ll_unwindbound100.c[490,503] [2022-04-14 16:01:37,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:01:37,126 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:01:37,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37 WrapperNode [2022-04-14 16:01:37,126 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:01:37,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:01:37,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:01:37,131 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:01:37,138 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,145 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,164 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,167 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:01:37,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:01:37,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:01:37,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:01:37,172 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (1/1) ... [2022-04-14 16:01:37,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:01:37,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:37,204 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 16:01:37,226 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 16:01:37,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:01:37,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:01:37,243 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:01:37,244 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:01:37,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:01:37,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:01:37,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:01:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:01:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:01:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:01:37,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:01:37,284 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:01:37,285 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:01:37,465 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:01:37,469 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:01:37,469 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-14 16:01:37,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:01:37 BoogieIcfgContainer [2022-04-14 16:01:37,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:01:37,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:01:37,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:01:37,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:01:37,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:01:36" (1/3) ... [2022-04-14 16:01:37,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@897ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:01:37, skipping insertion in model container [2022-04-14 16:01:37,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:01:37" (2/3) ... [2022-04-14 16:01:37,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@897ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:01:37, skipping insertion in model container [2022-04-14 16:01:37,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:01:37" (3/3) ... [2022-04-14 16:01:37,486 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound100.c [2022-04-14 16:01:37,489 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:01:37,489 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:01:37,528 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:01:37,534 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 16:01:37,534 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:01:37,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 16:01:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 16:01:37,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:37,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:37,551 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:37,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1766263304, now seen corresponding path program 1 times [2022-04-14 16:01:37,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:37,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193171171] [2022-04-14 16:01:37,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:37,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:01:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:37,757 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-14 16:01:37,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-14 16:01:37,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-14 16:01:37,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 16:01:37,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:37,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-14 16:01:37,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-14 16:01:37,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-14 16:01:37,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-14 16:01:37,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 16:01:37,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:37,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-14 16:01:37,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-14 16:01:37,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-14 16:01:37,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-14 16:01:37,780 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} call ULTIMATE.init(); {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 16:01:37,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {43#true} is VALID [2022-04-14 16:01:37,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} assume true; {43#true} is VALID [2022-04-14 16:01:37,780 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} #108#return; {43#true} is VALID [2022-04-14 16:01:37,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} call #t~ret9 := main(); {43#true} is VALID [2022-04-14 16:01:37,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {43#true} is VALID [2022-04-14 16:01:37,781 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-14 16:01:37,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-14 16:01:37,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-14 16:01:37,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-14 16:01:37,782 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} #94#return; {44#false} is VALID [2022-04-14 16:01:37,782 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {43#true} is VALID [2022-04-14 16:01:37,782 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} ~cond := #in~cond; {43#true} is VALID [2022-04-14 16:01:37,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} assume 0 == ~cond;assume false; {44#false} is VALID [2022-04-14 16:01:37,783 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} assume true; {44#false} is VALID [2022-04-14 16:01:37,783 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} #96#return; {44#false} is VALID [2022-04-14 16:01:37,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {44#false} is VALID [2022-04-14 16:01:37,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} assume !true; {44#false} is VALID [2022-04-14 16:01:37,783 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {44#false} is VALID [2022-04-14 16:01:37,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} ~cond := #in~cond; {44#false} is VALID [2022-04-14 16:01:37,784 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} assume 0 == ~cond; {44#false} is VALID [2022-04-14 16:01:37,784 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} assume !false; {44#false} is VALID [2022-04-14 16:01:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:37,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:37,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193171171] [2022-04-14 16:01:37,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193171171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:37,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:37,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 16:01:37,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579005759] [2022-04-14 16:01:37,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:37,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 16:01:37,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:37,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:37,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:37,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 16:01:37,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:37,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 16:01:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:01:37,824 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:37,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:37,942 INFO L93 Difference]: Finished difference Result 74 states and 111 transitions. [2022-04-14 16:01:37,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 16:01:37,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-14 16:01:37,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:37,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 16:01:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:37,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-14 16:01:37,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-14 16:01:38,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:38,046 INFO L225 Difference]: With dead ends: 74 [2022-04-14 16:01:38,047 INFO L226 Difference]: Without dead ends: 36 [2022-04-14 16:01:38,049 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 16:01:38,051 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:38,051 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:38,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-14 16:01:38,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-14 16:01:38,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:38,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,070 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,071 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:38,074 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-14 16:01:38,074 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-14 16:01:38,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:38,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:38,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 16:01:38,075 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-14 16:01:38,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:38,078 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-14 16:01:38,078 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-14 16:01:38,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:38,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:38,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:38,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:38,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-14 16:01:38,082 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-14 16:01:38,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:38,082 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-14 16:01:38,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,082 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-14 16:01:38,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-14 16:01:38,083 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:38,083 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:38,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 16:01:38,083 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -81203399, now seen corresponding path program 1 times [2022-04-14 16:01:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:38,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253726806] [2022-04-14 16:01:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:38,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:38,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:38,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [407215513] [2022-04-14 16:01:38,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:38,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:38,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:38,101 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 16:01:38,120 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 16:01:38,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:38,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:01:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:38,193 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:38,330 INFO L272 TraceCheckUtils]: 0: Hoare triple {284#true} call ULTIMATE.init(); {284#true} is VALID [2022-04-14 16:01:38,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#(<= ~counter~0 0)} {284#true} #108#return; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#(<= ~counter~0 0)} call #t~ret9 := main(); {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,333 INFO L272 TraceCheckUtils]: 6: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,334 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #94#return; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,335 INFO L272 TraceCheckUtils]: 11: Hoare triple {292#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {292#(<= ~counter~0 0)} ~cond := #in~cond; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {292#(<= ~counter~0 0)} assume !(0 == ~cond); {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {292#(<= ~counter~0 0)} assume true; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,337 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {292#(<= ~counter~0 0)} {292#(<= ~counter~0 0)} #96#return; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {292#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {292#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:38,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {292#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {341#(<= |main_#t~post6| 0)} is VALID [2022-04-14 16:01:38,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {341#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {285#false} is VALID [2022-04-14 16:01:38,338 INFO L272 TraceCheckUtils]: 19: Hoare triple {285#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {285#false} is VALID [2022-04-14 16:01:38,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {285#false} ~cond := #in~cond; {285#false} is VALID [2022-04-14 16:01:38,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {285#false} assume 0 == ~cond; {285#false} is VALID [2022-04-14 16:01:38,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {285#false} assume !false; {285#false} is VALID [2022-04-14 16:01:38,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:38,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:38,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:38,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253726806] [2022-04-14 16:01:38,339 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:38,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [407215513] [2022-04-14 16:01:38,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [407215513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:38,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:38,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:01:38,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742238387] [2022-04-14 16:01:38,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:38,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 16:01:38,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:38,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:38,356 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:01:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:01:38,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:01:38,357 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:38,432 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2022-04-14 16:01:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:01:38,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-14 16:01:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:38,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-14 16:01:38,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-04-14 16:01:38,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-04-14 16:01:38,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:38,474 INFO L225 Difference]: With dead ends: 44 [2022-04-14 16:01:38,474 INFO L226 Difference]: Without dead ends: 37 [2022-04-14 16:01:38,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:01:38,475 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:38,475 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-14 16:01:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-14 16:01:38,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:38,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,484 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,484 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:38,486 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-14 16:01:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-14 16:01:38,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:38,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:38,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-14 16:01:38,487 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-14 16:01:38,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:38,489 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-14 16:01:38,489 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-14 16:01:38,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:38,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:38,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:38,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:38,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:38,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-14 16:01:38,492 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-14 16:01:38,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:38,492 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-14 16:01:38,492 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:38,492 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-14 16:01:38,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-14 16:01:38,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:38,493 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:38,526 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 16:01:38,726 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 16:01:38,726 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:38,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1762644405, now seen corresponding path program 1 times [2022-04-14 16:01:38,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:38,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435828027] [2022-04-14 16:01:38,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:38,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:38,755 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:38,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [850669459] [2022-04-14 16:01:38,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:38,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:38,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:38,772 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 16:01:38,773 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 16:01:38,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:38,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:01:38,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:38,825 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:38,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {547#true} call ULTIMATE.init(); {547#true} is VALID [2022-04-14 16:01:38,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {547#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {547#true} is VALID [2022-04-14 16:01:38,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-14 16:01:38,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {547#true} {547#true} #108#return; {547#true} is VALID [2022-04-14 16:01:38,924 INFO L272 TraceCheckUtils]: 4: Hoare triple {547#true} call #t~ret9 := main(); {547#true} is VALID [2022-04-14 16:01:38,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {547#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {547#true} is VALID [2022-04-14 16:01:38,924 INFO L272 TraceCheckUtils]: 6: Hoare triple {547#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-14 16:01:38,924 INFO L290 TraceCheckUtils]: 7: Hoare triple {547#true} ~cond := #in~cond; {547#true} is VALID [2022-04-14 16:01:38,924 INFO L290 TraceCheckUtils]: 8: Hoare triple {547#true} assume !(0 == ~cond); {547#true} is VALID [2022-04-14 16:01:38,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {547#true} assume true; {547#true} is VALID [2022-04-14 16:01:38,924 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {547#true} {547#true} #94#return; {547#true} is VALID [2022-04-14 16:01:38,924 INFO L272 TraceCheckUtils]: 11: Hoare triple {547#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {547#true} is VALID [2022-04-14 16:01:38,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#true} ~cond := #in~cond; {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:01:38,925 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:38,925 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {592#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:38,926 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#(not (= |assume_abort_if_not_#in~cond| 0))} {547#true} #96#return; {599#(<= 1 main_~y~0)} is VALID [2022-04-14 16:01:38,926 INFO L290 TraceCheckUtils]: 16: Hoare triple {599#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {603#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:38,927 INFO L290 TraceCheckUtils]: 17: Hoare triple {603#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:38,927 INFO L290 TraceCheckUtils]: 18: Hoare triple {603#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {603#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:38,927 INFO L290 TraceCheckUtils]: 19: Hoare triple {603#(<= 1 main_~b~0)} assume !(0 != ~b~0); {548#false} is VALID [2022-04-14 16:01:38,927 INFO L272 TraceCheckUtils]: 20: Hoare triple {548#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {548#false} is VALID [2022-04-14 16:01:38,928 INFO L290 TraceCheckUtils]: 21: Hoare triple {548#false} ~cond := #in~cond; {548#false} is VALID [2022-04-14 16:01:38,928 INFO L290 TraceCheckUtils]: 22: Hoare triple {548#false} assume 0 == ~cond; {548#false} is VALID [2022-04-14 16:01:38,928 INFO L290 TraceCheckUtils]: 23: Hoare triple {548#false} assume !false; {548#false} is VALID [2022-04-14 16:01:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:38,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:38,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:38,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435828027] [2022-04-14 16:01:38,928 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:38,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850669459] [2022-04-14 16:01:38,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850669459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:38,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:38,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:01:38,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123047948] [2022-04-14 16:01:38,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-14 16:01:38,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:38,930 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:38,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:38,944 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:01:38,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:38,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:01:38,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:01:38,944 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:39,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,147 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2022-04-14 16:01:39,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:01:39,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-14 16:01:39,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:39,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-14 16:01:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 75 transitions. [2022-04-14 16:01:39,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 75 transitions. [2022-04-14 16:01:39,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:39,223 INFO L225 Difference]: With dead ends: 57 [2022-04-14 16:01:39,223 INFO L226 Difference]: Without dead ends: 50 [2022-04-14 16:01:39,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-14 16:01:39,224 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:39,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:39,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-14 16:01:39,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-14 16:01:39,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:39,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,237 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,237 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,239 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-14 16:01:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-14 16:01:39,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:39,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:39,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-14 16:01:39,240 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-14 16:01:39,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,242 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-14 16:01:39,242 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-14 16:01:39,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:39,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:39,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:39,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:39,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-14 16:01:39,244 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-14 16:01:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:39,244 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-14 16:01:39,245 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-14 16:01:39,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:01:39,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:39,245 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:39,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:39,446 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 16:01:39,446 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:39,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1090347867, now seen corresponding path program 1 times [2022-04-14 16:01:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:39,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026031121] [2022-04-14 16:01:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:39,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:39,460 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:39,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665641141] [2022-04-14 16:01:39,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:39,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:39,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:39,461 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 16:01:39,467 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 16:01:39,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:39,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:01:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:39,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:39,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {865#true} call ULTIMATE.init(); {865#true} is VALID [2022-04-14 16:01:39,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {865#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#(<= ~counter~0 0)} {865#true} #108#return; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#(<= ~counter~0 0)} call #t~ret9 := main(); {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,644 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #94#return; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,645 INFO L272 TraceCheckUtils]: 11: Hoare triple {873#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {873#(<= ~counter~0 0)} ~cond := #in~cond; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(<= ~counter~0 0)} assume !(0 == ~cond); {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(<= ~counter~0 0)} assume true; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,646 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {873#(<= ~counter~0 0)} {873#(<= ~counter~0 0)} #96#return; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {873#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {873#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:39,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:39,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {922#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:39,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {922#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:39,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {932#(<= |main_#t~post7| 1)} is VALID [2022-04-14 16:01:39,651 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {866#false} is VALID [2022-04-14 16:01:39,651 INFO L290 TraceCheckUtils]: 22: Hoare triple {866#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {866#false} is VALID [2022-04-14 16:01:39,651 INFO L290 TraceCheckUtils]: 23: Hoare triple {866#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {866#false} is VALID [2022-04-14 16:01:39,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#false} assume !(#t~post6 < 100);havoc #t~post6; {866#false} is VALID [2022-04-14 16:01:39,651 INFO L272 TraceCheckUtils]: 25: Hoare triple {866#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {866#false} is VALID [2022-04-14 16:01:39,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {866#false} ~cond := #in~cond; {866#false} is VALID [2022-04-14 16:01:39,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {866#false} assume 0 == ~cond; {866#false} is VALID [2022-04-14 16:01:39,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {866#false} assume !false; {866#false} is VALID [2022-04-14 16:01:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:39,653 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026031121] [2022-04-14 16:01:39,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:39,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665641141] [2022-04-14 16:01:39,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665641141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:39,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:39,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:01:39,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424855130] [2022-04-14 16:01:39,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:39,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-14 16:01:39,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:39,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:39,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:39,674 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:01:39,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:39,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:01:39,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:01:39,676 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:39,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,789 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-04-14 16:01:39,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:01:39,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-14 16:01:39,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:39,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:39,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-14 16:01:39,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:39,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2022-04-14 16:01:39,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 82 transitions. [2022-04-14 16:01:39,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:39,850 INFO L225 Difference]: With dead ends: 62 [2022-04-14 16:01:39,850 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 16:01:39,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:01:39,851 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:39,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 16:01:39,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-14 16:01:39,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:39,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,868 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,869 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,870 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-14 16:01:39,870 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-14 16:01:39,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:39,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:39,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-14 16:01:39,871 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-14 16:01:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:39,873 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-14 16:01:39,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-14 16:01:39,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:39,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:39,873 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:39,873 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:39,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-14 16:01:39,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-14 16:01:39,875 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-14 16:01:39,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:39,875 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-14 16:01:39,875 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-14 16:01:39,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 16:01:39,876 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:39,876 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:39,915 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 16:01:40,076 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 16:01:40,077 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 795698770, now seen corresponding path program 1 times [2022-04-14 16:01:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:40,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189126846] [2022-04-14 16:01:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:40,094 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:40,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [535858793] [2022-04-14 16:01:40,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:40,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:40,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:40,095 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 16:01:40,098 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 16:01:40,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:40,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 16:01:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:40,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:40,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1183#true} {1183#true} #108#return; {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1183#true} call #t~ret9 := main(); {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1183#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {1183#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-14 16:01:40,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-14 16:01:40,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-14 16:01:40,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-14 16:01:40,488 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1183#true} #94#return; {1183#true} is VALID [2022-04-14 16:01:40,488 INFO L272 TraceCheckUtils]: 11: Hoare triple {1183#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1183#true} is VALID [2022-04-14 16:01:40,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:01:40,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {1224#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:40,505 INFO L290 TraceCheckUtils]: 14: Hoare triple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1228#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:40,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1228#(not (= |assume_abort_if_not_#in~cond| 0))} {1183#true} #96#return; {1235#(<= 1 main_~y~0)} is VALID [2022-04-14 16:01:40,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {1235#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {1239#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,509 INFO L290 TraceCheckUtils]: 22: Hoare triple {1249#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:40,510 INFO L272 TraceCheckUtils]: 25: Hoare triple {1259#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:40,510 INFO L290 TraceCheckUtils]: 26: Hoare triple {1269#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1273#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:40,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {1273#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1184#false} is VALID [2022-04-14 16:01:40,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-14 16:01:40,511 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:40,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:40,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189126846] [2022-04-14 16:01:40,511 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535858793] [2022-04-14 16:01:40,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535858793] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:40,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:40,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-14 16:01:40,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883849874] [2022-04-14 16:01:40,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:40,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-14 16:01:40,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:40,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:40,531 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 16:01:40,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:01:40,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:40,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:01:40,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:01:40,532 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:41,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:41,144 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-04-14 16:01:41,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 16:01:41,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-14 16:01:41,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:41,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-14 16:01:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-14 16:01:41,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-14 16:01:41,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:41,222 INFO L225 Difference]: With dead ends: 68 [2022-04-14 16:01:41,222 INFO L226 Difference]: Without dead ends: 66 [2022-04-14 16:01:41,223 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:01:41,223 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:41,224 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 237 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:01:41,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-14 16:01:41,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-14 16:01:41,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:41,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:01:41,261 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:01:41,262 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:01:41,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:41,264 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-14 16:01:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-14 16:01:41,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:41,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:41,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-14 16:01:41,265 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-14 16:01:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:41,267 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-14 16:01:41,267 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-14 16:01:41,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:41,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:41,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:41,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:41,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 16:01:41,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-14 16:01:41,270 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-14 16:01:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:41,270 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-14 16:01:41,270 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:01:41,270 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-14 16:01:41,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-14 16:01:41,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:41,270 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:41,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:41,487 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 16:01:41,487 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:41,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:41,487 INFO L85 PathProgramCache]: Analyzing trace with hash 979890972, now seen corresponding path program 1 times [2022-04-14 16:01:41,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:41,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012641306] [2022-04-14 16:01:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:41,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:41,502 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:41,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544404685] [2022-04-14 16:01:41,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:41,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:41,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:41,519 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 16:01:41,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-14 16:01:41,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:41,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 16:01:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:41,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:41,742 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-14 16:01:41,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1605#(<= ~counter~0 0)} {1597#true} #108#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,743 INFO L272 TraceCheckUtils]: 4: Hoare triple {1605#(<= ~counter~0 0)} call #t~ret9 := main(); {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {1605#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,745 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #94#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,745 INFO L272 TraceCheckUtils]: 11: Hoare triple {1605#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {1605#(<= ~counter~0 0)} ~cond := #in~cond; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {1605#(<= ~counter~0 0)} assume !(0 == ~cond); {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {1605#(<= ~counter~0 0)} assume true; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,747 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1605#(<= ~counter~0 0)} {1605#(<= ~counter~0 0)} #96#return; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {1605#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1605#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:41,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {1605#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:41,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {1654#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1654#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:41,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {1654#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1654#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:41,748 INFO L290 TraceCheckUtils]: 20: Hoare triple {1654#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:41,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {1664#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {1664#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:41,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {1664#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {1664#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:41,752 INFO L290 TraceCheckUtils]: 23: Hoare triple {1664#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1664#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:41,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {1664#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1677#(<= |main_#t~post6| 2)} is VALID [2022-04-14 16:01:41,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {1677#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {1598#false} is VALID [2022-04-14 16:01:41,752 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-14 16:01:41,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-14 16:01:41,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-14 16:01:41,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-14 16:01:41,753 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:41,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:41,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {1598#false} assume !false; {1598#false} is VALID [2022-04-14 16:01:41,882 INFO L290 TraceCheckUtils]: 28: Hoare triple {1598#false} assume 0 == ~cond; {1598#false} is VALID [2022-04-14 16:01:41,882 INFO L290 TraceCheckUtils]: 27: Hoare triple {1598#false} ~cond := #in~cond; {1598#false} is VALID [2022-04-14 16:01:41,882 INFO L272 TraceCheckUtils]: 26: Hoare triple {1598#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {1598#false} is VALID [2022-04-14 16:01:41,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {1705#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1598#false} is VALID [2022-04-14 16:01:41,882 INFO L290 TraceCheckUtils]: 24: Hoare triple {1709#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1705#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:01:41,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {1709#(< ~counter~0 100)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {1709#(< ~counter~0 100)} is VALID [2022-04-14 16:01:41,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {1709#(< ~counter~0 100)} assume !(~c~0 >= ~b~0); {1709#(< ~counter~0 100)} is VALID [2022-04-14 16:01:41,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {1709#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {1709#(< ~counter~0 100)} is VALID [2022-04-14 16:01:41,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {1722#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1709#(< ~counter~0 100)} is VALID [2022-04-14 16:01:41,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {1722#(< ~counter~0 99)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {1722#(< ~counter~0 99)} is VALID [2022-04-14 16:01:41,884 INFO L290 TraceCheckUtils]: 18: Hoare triple {1722#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {1722#(< ~counter~0 99)} is VALID [2022-04-14 16:01:41,885 INFO L290 TraceCheckUtils]: 17: Hoare triple {1732#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1722#(< ~counter~0 99)} is VALID [2022-04-14 16:01:41,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {1732#(< ~counter~0 98)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,888 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1597#true} {1732#(< ~counter~0 98)} #96#return; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 12: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L272 TraceCheckUtils]: 11: Hoare triple {1732#(< ~counter~0 98)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1597#true} {1732#(< ~counter~0 98)} #94#return; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {1597#true} assume true; {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {1597#true} assume !(0 == ~cond); {1597#true} is VALID [2022-04-14 16:01:41,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#true} ~cond := #in~cond; {1597#true} is VALID [2022-04-14 16:01:41,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {1732#(< ~counter~0 98)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1597#true} is VALID [2022-04-14 16:01:41,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {1732#(< ~counter~0 98)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {1732#(< ~counter~0 98)} call #t~ret9 := main(); {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1732#(< ~counter~0 98)} {1597#true} #108#return; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {1732#(< ~counter~0 98)} assume true; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {1597#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1732#(< ~counter~0 98)} is VALID [2022-04-14 16:01:41,891 INFO L272 TraceCheckUtils]: 0: Hoare triple {1597#true} call ULTIMATE.init(); {1597#true} is VALID [2022-04-14 16:01:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:41,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012641306] [2022-04-14 16:01:41,891 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:41,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544404685] [2022-04-14 16:01:41,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544404685] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:41,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:41,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-14 16:01:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051572339] [2022-04-14 16:01:41,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:41,892 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-14 16:01:41,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:41,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:41,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:41,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:01:41,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:01:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:01:41,914 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:42,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:42,243 INFO L93 Difference]: Finished difference Result 151 states and 197 transitions. [2022-04-14 16:01:42,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-14 16:01:42,243 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-14 16:01:42,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:42,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-14 16:01:42,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 145 transitions. [2022-04-14 16:01:42,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 145 transitions. [2022-04-14 16:01:42,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:42,311 INFO L225 Difference]: With dead ends: 151 [2022-04-14 16:01:42,311 INFO L226 Difference]: Without dead ends: 144 [2022-04-14 16:01:42,312 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-04-14 16:01:42,312 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 132 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:42,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [132 Valid, 257 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:01:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-04-14 16:01:42,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 101. [2022-04-14 16:01:42,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:42,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 16:01:42,394 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 16:01:42,395 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 16:01:42,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:42,399 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-14 16:01:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-14 16:01:42,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:42,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:42,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-14 16:01:42,402 INFO L87 Difference]: Start difference. First operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 144 states. [2022-04-14 16:01:42,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:42,406 INFO L93 Difference]: Finished difference Result 144 states and 188 transitions. [2022-04-14 16:01:42,406 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 188 transitions. [2022-04-14 16:01:42,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:42,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:42,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:42,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:42,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 72 states have internal predecessors, (93), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 16:01:42,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 134 transitions. [2022-04-14 16:01:42,410 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 134 transitions. Word has length 30 [2022-04-14 16:01:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:42,410 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 134 transitions. [2022-04-14 16:01:42,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:42,410 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 134 transitions. [2022-04-14 16:01:42,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-14 16:01:42,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:42,411 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:42,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-14 16:01:42,623 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:42,624 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:42,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:42,624 INFO L85 PathProgramCache]: Analyzing trace with hash 296831538, now seen corresponding path program 1 times [2022-04-14 16:01:42,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:42,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902422672] [2022-04-14 16:01:42,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:42,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:42,643 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:42,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [819179428] [2022-04-14 16:01:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:42,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:42,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:42,644 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:42,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-14 16:01:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:42,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 16:01:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:42,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:42,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2022-04-14 16:01:42,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2441#true} is VALID [2022-04-14 16:01:42,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-14 16:01:42,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} #108#return; {2441#true} is VALID [2022-04-14 16:01:42,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} call #t~ret9 := main(); {2441#true} is VALID [2022-04-14 16:01:42,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2441#true} is VALID [2022-04-14 16:01:42,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-14 16:01:42,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} ~cond := #in~cond; {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:01:42,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {2467#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:42,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:42,817 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} #94#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:42,817 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-14 16:01:42,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} ~cond := #in~cond; {2441#true} is VALID [2022-04-14 16:01:42,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} assume !(0 == ~cond); {2441#true} is VALID [2022-04-14 16:01:42,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-14 16:01:42,818 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} #96#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:42,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:42,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:42,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:42,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:42,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:42,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:42,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:42,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:42,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:42,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:42,821 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2442#false} is VALID [2022-04-14 16:01:42,821 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2442#false} is VALID [2022-04-14 16:01:42,821 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2022-04-14 16:01:42,822 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} assume 0 == ~cond; {2442#false} is VALID [2022-04-14 16:01:42,822 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2022-04-14 16:01:42,822 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:42,822 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:43,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {2442#false} assume !false; {2442#false} is VALID [2022-04-14 16:01:43,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {2442#false} assume 0 == ~cond; {2442#false} is VALID [2022-04-14 16:01:43,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {2442#false} ~cond := #in~cond; {2442#false} is VALID [2022-04-14 16:01:43,005 INFO L272 TraceCheckUtils]: 27: Hoare triple {2442#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {2442#false} is VALID [2022-04-14 16:01:43,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {2520#(<= 1 main_~b~0)} assume !(0 != ~b~0); {2442#false} is VALID [2022-04-14 16:01:43,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {2520#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:43,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {2520#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:43,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {2507#(<= 1 main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {2520#(<= 1 main_~b~0)} is VALID [2022-04-14 16:01:43,007 INFO L290 TraceCheckUtils]: 22: Hoare triple {2507#(<= 1 main_~c~0)} assume !(~c~0 >= ~b~0); {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:43,007 INFO L290 TraceCheckUtils]: 21: Hoare triple {2507#(<= 1 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:43,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {2507#(<= 1 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:43,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {2507#(<= 1 main_~c~0)} is VALID [2022-04-14 16:01:43,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {2497#(<= 1 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:43,013 INFO L290 TraceCheckUtils]: 17: Hoare triple {2497#(<= 1 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:43,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {2478#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {2497#(<= 1 main_~a~0)} is VALID [2022-04-14 16:01:43,018 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2441#true} {2478#(<= 1 main_~x~0)} #96#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:43,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-14 16:01:43,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {2441#true} assume !(0 == ~cond); {2441#true} is VALID [2022-04-14 16:01:43,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {2441#true} ~cond := #in~cond; {2441#true} is VALID [2022-04-14 16:01:43,019 INFO L272 TraceCheckUtils]: 11: Hoare triple {2478#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-14 16:01:43,019 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} {2441#true} #94#return; {2478#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:43,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {2471#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:43,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {2471#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:43,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {2441#true} ~cond := #in~cond; {2611#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-14 16:01:43,020 INFO L272 TraceCheckUtils]: 6: Hoare triple {2441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {2441#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {2441#true} call #t~ret9 := main(); {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2441#true} {2441#true} #108#return; {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {2441#true} assume true; {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {2441#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2441#true} is VALID [2022-04-14 16:01:43,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {2441#true} call ULTIMATE.init(); {2441#true} is VALID [2022-04-14 16:01:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:43,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902422672] [2022-04-14 16:01:43,021 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:43,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819179428] [2022-04-14 16:01:43,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819179428] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:43,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:43,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-14 16:01:43,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300157229] [2022-04-14 16:01:43,021 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:43,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-14 16:01:43,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:43,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:43,039 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 16:01:43,039 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 16:01:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:43,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 16:01:43,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 16:01:43,039 INFO L87 Difference]: Start difference. First operand 101 states and 134 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:43,837 INFO L93 Difference]: Finished difference Result 187 states and 265 transitions. [2022-04-14 16:01:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 16:01:43,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-14 16:01:43,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:43,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:43,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-14 16:01:43,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 155 transitions. [2022-04-14 16:01:43,843 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 155 transitions. [2022-04-14 16:01:43,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:43,916 INFO L225 Difference]: With dead ends: 187 [2022-04-14 16:01:43,916 INFO L226 Difference]: Without dead ends: 175 [2022-04-14 16:01:43,917 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-14 16:01:43,917 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 113 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:43,917 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 358 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:01:43,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-14 16:01:44,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2022-04-14 16:01:44,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:44,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:44,068 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:44,068 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:44,074 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-14 16:01:44,074 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-14 16:01:44,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:44,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:44,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-14 16:01:44,075 INFO L87 Difference]: Start difference. First operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 175 states. [2022-04-14 16:01:44,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:44,080 INFO L93 Difference]: Finished difference Result 175 states and 251 transitions. [2022-04-14 16:01:44,080 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 251 transitions. [2022-04-14 16:01:44,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:44,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:44,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:44,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:44,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 98 states have (on average 1.346938775510204) internal successors, (132), 99 states have internal predecessors, (132), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:44,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2022-04-14 16:01:44,085 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 31 [2022-04-14 16:01:44,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:44,085 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2022-04-14 16:01:44,085 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:44,085 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2022-04-14 16:01:44,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-14 16:01:44,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:44,086 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:44,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-14 16:01:44,302 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:44,302 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:44,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:44,303 INFO L85 PathProgramCache]: Analyzing trace with hash 495607521, now seen corresponding path program 1 times [2022-04-14 16:01:44,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:44,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875736494] [2022-04-14 16:01:44,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:44,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:44,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:44,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1343855029] [2022-04-14 16:01:44,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:44,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:44,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:44,320 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:44,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-14 16:01:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:44,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 16:01:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:44,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:44,720 INFO L272 TraceCheckUtils]: 0: Hoare triple {3457#true} call ULTIMATE.init(); {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {3457#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3457#true} {3457#true} #108#return; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L272 TraceCheckUtils]: 4: Hoare triple {3457#true} call #t~ret9 := main(); {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {3457#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L272 TraceCheckUtils]: 6: Hoare triple {3457#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 8: Hoare triple {3457#true} assume !(0 == ~cond); {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-14 16:01:44,721 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3457#true} {3457#true} #94#return; {3457#true} is VALID [2022-04-14 16:01:44,722 INFO L272 TraceCheckUtils]: 11: Hoare triple {3457#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3457#true} is VALID [2022-04-14 16:01:44,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {3457#true} ~cond := #in~cond; {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:01:44,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {3498#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:44,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {3502#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:44,723 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3502#(not (= |assume_abort_if_not_#in~cond| 0))} {3457#true} #96#return; {3509#(<= 1 main_~y~0)} is VALID [2022-04-14 16:01:44,723 INFO L290 TraceCheckUtils]: 16: Hoare triple {3509#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,724 INFO L290 TraceCheckUtils]: 17: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {3513#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {3523#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} assume !!(#t~post8 < 100);havoc #t~post8; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,727 INFO L272 TraceCheckUtils]: 25: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {3457#true} is VALID [2022-04-14 16:01:44,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {3457#true} ~cond := #in~cond; {3457#true} is VALID [2022-04-14 16:01:44,727 INFO L290 TraceCheckUtils]: 27: Hoare triple {3457#true} assume !(0 == ~cond); {3457#true} is VALID [2022-04-14 16:01:44,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {3457#true} assume true; {3457#true} is VALID [2022-04-14 16:01:44,729 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {3457#true} {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} #98#return; {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-14 16:01:44,729 INFO L272 TraceCheckUtils]: 30: Hoare triple {3533#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:44,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {3558#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3562#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:44,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {3562#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3458#false} is VALID [2022-04-14 16:01:44,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {3458#false} assume !false; {3458#false} is VALID [2022-04-14 16:01:44,730 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:44,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:44,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875736494] [2022-04-14 16:01:44,731 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:44,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343855029] [2022-04-14 16:01:44,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343855029] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:44,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:44,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-14 16:01:44,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503516908] [2022-04-14 16:01:44,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:44,731 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 16:01:44,732 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:44,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 16:01:44,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:44,755 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:01:44,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:44,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:01:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:01:44,756 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 16:01:45,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:45,444 INFO L93 Difference]: Finished difference Result 157 states and 210 transitions. [2022-04-14 16:01:45,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-14 16:01:45,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-14 16:01:45,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:45,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 16:01:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-14 16:01:45,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 16:01:45,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 93 transitions. [2022-04-14 16:01:45,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 93 transitions. [2022-04-14 16:01:45,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:45,519 INFO L225 Difference]: With dead ends: 157 [2022-04-14 16:01:45,519 INFO L226 Difference]: Without dead ends: 155 [2022-04-14 16:01:45,519 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-14 16:01:45,519 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 80 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:45,520 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 241 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:01:45,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-14 16:01:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 144. [2022-04-14 16:01:45,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:45,692 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:45,692 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:45,693 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:45,696 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-14 16:01:45,696 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-14 16:01:45,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:45,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:45,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-14 16:01:45,697 INFO L87 Difference]: Start difference. First operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 155 states. [2022-04-14 16:01:45,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:45,701 INFO L93 Difference]: Finished difference Result 155 states and 206 transitions. [2022-04-14 16:01:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 206 transitions. [2022-04-14 16:01:45,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:45,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:45,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:45,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:45,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 107 states have (on average 1.3177570093457944) internal successors, (141), 108 states have internal predecessors, (141), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 16:01:45,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 189 transitions. [2022-04-14 16:01:45,706 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 189 transitions. Word has length 34 [2022-04-14 16:01:45,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:45,706 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 189 transitions. [2022-04-14 16:01:45,706 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-14 16:01:45,706 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 189 transitions. [2022-04-14 16:01:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 16:01:45,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:45,706 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:45,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:45,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:45,918 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:45,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:45,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1581560821, now seen corresponding path program 1 times [2022-04-14 16:01:45,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:45,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748965601] [2022-04-14 16:01:45,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:45,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:45,948 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:45,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322981630] [2022-04-14 16:01:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:45,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:45,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:45,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:45,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-14 16:01:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:45,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-14 16:01:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:46,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:46,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} call ULTIMATE.init(); {4310#true} is VALID [2022-04-14 16:01:46,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} #108#return; {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} call #t~ret9 := main(); {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-14 16:01:46,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} ~cond := #in~cond; {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:01:46,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {4336#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:46,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4340#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:01:46,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4340#(not (= |assume_abort_if_not_#in~cond| 0))} {4310#true} #94#return; {4347#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:46,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {4347#(<= 1 main_~x~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-14 16:01:46,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-14 16:01:46,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-14 16:01:46,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-14 16:01:46,320 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4347#(<= 1 main_~x~0)} #96#return; {4347#(<= 1 main_~x~0)} is VALID [2022-04-14 16:01:46,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {4347#(<= 1 main_~x~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,321 INFO L290 TraceCheckUtils]: 18: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,322 INFO L290 TraceCheckUtils]: 19: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,322 INFO L290 TraceCheckUtils]: 20: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,322 INFO L290 TraceCheckUtils]: 21: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} assume !(~c~0 >= ~b~0); {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 16:01:46,323 INFO L290 TraceCheckUtils]: 23: Hoare triple {4366#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,324 INFO L290 TraceCheckUtils]: 26: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post8 < 100);havoc #t~post8; {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:01:46,327 INFO L272 TraceCheckUtils]: 32: Hoare triple {4388#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:46,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:46,328 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4311#false} is VALID [2022-04-14 16:01:46,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} assume !false; {4311#false} is VALID [2022-04-14 16:01:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-14 16:01:46,328 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:46,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {4311#false} assume !false; {4311#false} is VALID [2022-04-14 16:01:46,516 INFO L290 TraceCheckUtils]: 34: Hoare triple {4420#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4311#false} is VALID [2022-04-14 16:01:46,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4420#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:46,517 INFO L272 TraceCheckUtils]: 32: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {4416#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:46,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {4436#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:46,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,522 INFO L290 TraceCheckUtils]: 16: Hoare triple {4310#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {4464#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:46,522 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4310#true} {4310#true} #96#return; {4310#true} is VALID [2022-04-14 16:01:46,522 INFO L290 TraceCheckUtils]: 14: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-14 16:01:46,522 INFO L290 TraceCheckUtils]: 13: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {4310#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4310#true} {4310#true} #94#return; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 8: Hoare triple {4310#true} assume !(0 == ~cond); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {4310#true} ~cond := #in~cond; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L272 TraceCheckUtils]: 6: Hoare triple {4310#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {4310#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {4310#true} call #t~ret9 := main(); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4310#true} {4310#true} #108#return; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {4310#true} assume true; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {4310#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {4310#true} call ULTIMATE.init(); {4310#true} is VALID [2022-04-14 16:01:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:46,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748965601] [2022-04-14 16:01:46,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:46,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322981630] [2022-04-14 16:01:46,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322981630] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:46,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:46,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-14 16:01:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263629992] [2022-04-14 16:01:46,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 16:01:46,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:46,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:46,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:46,562 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-14 16:01:46,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:46,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-14 16:01:46,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 16:01:46,563 INFO L87 Difference]: Start difference. First operand 144 states and 189 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:47,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:47,251 INFO L93 Difference]: Finished difference Result 179 states and 241 transitions. [2022-04-14 16:01:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 16:01:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-14 16:01:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:47,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:47,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-14 16:01:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2022-04-14 16:01:47,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2022-04-14 16:01:47,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:47,303 INFO L225 Difference]: With dead ends: 179 [2022-04-14 16:01:47,303 INFO L226 Difference]: Without dead ends: 177 [2022-04-14 16:01:47,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:01:47,304 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 76 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:47,304 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 336 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:01:47,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-14 16:01:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2022-04-14 16:01:47,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:47,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:47,497 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:47,498 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:47,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:47,511 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-14 16:01:47,511 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-14 16:01:47,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:47,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:47,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-14 16:01:47,512 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 177 states. [2022-04-14 16:01:47,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:47,516 INFO L93 Difference]: Finished difference Result 177 states and 239 transitions. [2022-04-14 16:01:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2022-04-14 16:01:47,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:47,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:47,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:47,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.34375) internal successors, (172), 129 states have internal predecessors, (172), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 236 transitions. [2022-04-14 16:01:47,520 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 236 transitions. Word has length 36 [2022-04-14 16:01:47,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:47,520 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 236 transitions. [2022-04-14 16:01:47,520 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:47,520 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 236 transitions. [2022-04-14 16:01:47,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-14 16:01:47,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:47,521 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:47,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:47,737 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-14 16:01:47,737 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:47,738 INFO L85 PathProgramCache]: Analyzing trace with hash -892181054, now seen corresponding path program 1 times [2022-04-14 16:01:47,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:47,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473485767] [2022-04-14 16:01:47,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:47,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:47,750 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784565660] [2022-04-14 16:01:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:47,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:47,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:47,758 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:47,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-14 16:01:47,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:47,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 16:01:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:47,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:47,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {5394#true} call ULTIMATE.init(); {5394#true} is VALID [2022-04-14 16:01:47,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {5394#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5402#(<= ~counter~0 0)} {5394#true} #108#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {5402#(<= ~counter~0 0)} call #t~ret9 := main(); {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {5402#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {5402#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {5402#(<= ~counter~0 0)} ~cond := #in~cond; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:47,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {5402#(<= ~counter~0 0)} assume !(0 == ~cond); {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,000 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} #94#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,000 INFO L272 TraceCheckUtils]: 11: Hoare triple {5402#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {5402#(<= ~counter~0 0)} ~cond := #in~cond; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {5402#(<= ~counter~0 0)} assume !(0 == ~cond); {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {5402#(<= ~counter~0 0)} assume true; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,003 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5402#(<= ~counter~0 0)} {5402#(<= ~counter~0 0)} #96#return; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {5402#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {5402#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:48,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {5402#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5451#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:48,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {5451#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5451#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:48,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {5451#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {5451#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:48,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {5451#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5461#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:48,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {5461#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5461#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:48,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {5461#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {5461#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:48,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {5461#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5471#(<= |main_#t~post8| 2)} is VALID [2022-04-14 16:01:48,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {5471#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {5395#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {5395#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {5395#false} assume !(#t~post7 < 100);havoc #t~post7; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {5395#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {5395#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {5395#false} assume !!(#t~post6 < 100);havoc #t~post6; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 31: Hoare triple {5395#false} assume !(0 != ~b~0); {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L272 TraceCheckUtils]: 32: Hoare triple {5395#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {5395#false} ~cond := #in~cond; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {5395#false} assume 0 == ~cond; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L290 TraceCheckUtils]: 35: Hoare triple {5395#false} assume !false; {5395#false} is VALID [2022-04-14 16:01:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:48,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:48,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473485767] [2022-04-14 16:01:48,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:48,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784565660] [2022-04-14 16:01:48,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784565660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:48,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:48,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-14 16:01:48,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471057822] [2022-04-14 16:01:48,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:48,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-14 16:01:48,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:48,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:48,023 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 16:01:48,023 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 16:01:48,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:48,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 16:01:48,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:01:48,024 INFO L87 Difference]: Start difference. First operand 174 states and 236 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:48,246 INFO L93 Difference]: Finished difference Result 241 states and 329 transitions. [2022-04-14 16:01:48,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:01:48,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-14 16:01:48,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:48,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-14 16:01:48,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2022-04-14 16:01:48,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2022-04-14 16:01:48,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:48,302 INFO L225 Difference]: With dead ends: 241 [2022-04-14 16:01:48,302 INFO L226 Difference]: Without dead ends: 174 [2022-04-14 16:01:48,303 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:01:48,303 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:48,303 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 139 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:48,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-14 16:01:48,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2022-04-14 16:01:48,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:48,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:48,492 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:48,492 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:48,495 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-14 16:01:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-14 16:01:48,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:48,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:48,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-14 16:01:48,497 INFO L87 Difference]: Start difference. First operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand 174 states. [2022-04-14 16:01:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:48,500 INFO L93 Difference]: Finished difference Result 174 states and 235 transitions. [2022-04-14 16:01:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-14 16:01:48,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:48,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:48,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:48,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 128 states have (on average 1.3359375) internal successors, (171), 129 states have internal predecessors, (171), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-14 16:01:48,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 235 transitions. [2022-04-14 16:01:48,504 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 235 transitions. Word has length 36 [2022-04-14 16:01:48,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:48,504 INFO L478 AbstractCegarLoop]: Abstraction has 174 states and 235 transitions. [2022-04-14 16:01:48,504 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 16:01:48,504 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 235 transitions. [2022-04-14 16:01:48,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-14 16:01:48,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:48,504 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:48,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:48,720 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-14 16:01:48,721 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -957710478, now seen corresponding path program 1 times [2022-04-14 16:01:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:48,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273915902] [2022-04-14 16:01:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:48,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:48,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1944243872] [2022-04-14 16:01:48,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:48,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:48,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:48,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:48,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-14 16:01:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:48,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:01:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:48,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:48,911 INFO L272 TraceCheckUtils]: 0: Hoare triple {6441#true} call ULTIMATE.init(); {6441#true} is VALID [2022-04-14 16:01:48,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {6441#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6441#true} is VALID [2022-04-14 16:01:48,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-14 16:01:48,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6441#true} {6441#true} #108#return; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L272 TraceCheckUtils]: 4: Hoare triple {6441#true} call #t~ret9 := main(); {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {6441#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L272 TraceCheckUtils]: 6: Hoare triple {6441#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6441#true} {6441#true} #94#return; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L272 TraceCheckUtils]: 11: Hoare triple {6441#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6441#true} {6441#true} #96#return; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 16: Hoare triple {6441#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {6441#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6441#true} is VALID [2022-04-14 16:01:48,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {6441#true} assume !!(#t~post6 < 100);havoc #t~post6; {6441#true} is VALID [2022-04-14 16:01:48,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {6441#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,917 INFO L272 TraceCheckUtils]: 25: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L290 TraceCheckUtils]: 27: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #98#return; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,918 INFO L272 TraceCheckUtils]: 30: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L290 TraceCheckUtils]: 31: Hoare triple {6441#true} ~cond := #in~cond; {6441#true} is VALID [2022-04-14 16:01:48,918 INFO L290 TraceCheckUtils]: 32: Hoare triple {6441#true} assume !(0 == ~cond); {6441#true} is VALID [2022-04-14 16:01:48,919 INFO L290 TraceCheckUtils]: 33: Hoare triple {6441#true} assume true; {6441#true} is VALID [2022-04-14 16:01:48,920 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {6441#true} {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} #100#return; {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-14 16:01:48,921 INFO L272 TraceCheckUtils]: 35: Hoare triple {6503#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:48,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {6552#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6556#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:48,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {6556#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6442#false} is VALID [2022-04-14 16:01:48,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {6442#false} assume !false; {6442#false} is VALID [2022-04-14 16:01:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-14 16:01:48,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:48,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273915902] [2022-04-14 16:01:48,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:48,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944243872] [2022-04-14 16:01:48,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1944243872] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:48,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:48,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:01:48,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363400667] [2022-04-14 16:01:48,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:48,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-14 16:01:48,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:48,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:48,941 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 16:01:48,941 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:01:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:01:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:01:48,942 INFO L87 Difference]: Start difference. First operand 174 states and 235 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:49,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:49,318 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2022-04-14 16:01:49,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:01:49,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-14 16:01:49,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 16:01:49,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:49,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 16:01:49,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-14 16:01:49,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:49,368 INFO L225 Difference]: With dead ends: 239 [2022-04-14 16:01:49,368 INFO L226 Difference]: Without dead ends: 237 [2022-04-14 16:01:49,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:01:49,369 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:49,369 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-14 16:01:49,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-04-14 16:01:49,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:49,647 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 16:01:49,647 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 16:01:49,647 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 16:01:49,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:49,653 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-14 16:01:49,653 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-14 16:01:49,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:49,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:49,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-14 16:01:49,654 INFO L87 Difference]: Start difference. First operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) Second operand 237 states. [2022-04-14 16:01:49,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:49,659 INFO L93 Difference]: Finished difference Result 237 states and 331 transitions. [2022-04-14 16:01:49,659 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 331 transitions. [2022-04-14 16:01:49,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:49,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:49,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:49,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:49,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 161 states have (on average 1.3664596273291925) internal successors, (220), 162 states have internal predecessors, (220), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-14 16:01:49,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 324 transitions. [2022-04-14 16:01:49,665 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 324 transitions. Word has length 39 [2022-04-14 16:01:49,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:49,665 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 324 transitions. [2022-04-14 16:01:49,665 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-14 16:01:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 324 transitions. [2022-04-14 16:01:49,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-14 16:01:49,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:49,666 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:49,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:49,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-14 16:01:49,882 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:49,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:49,882 INFO L85 PathProgramCache]: Analyzing trace with hash 409018142, now seen corresponding path program 1 times [2022-04-14 16:01:49,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:49,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972068698] [2022-04-14 16:01:49,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:49,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:49,892 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:49,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885735675] [2022-04-14 16:01:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:49,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:49,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:49,893 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:49,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-14 16:01:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:49,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-14 16:01:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:49,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:50,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} call ULTIMATE.init(); {7713#true} is VALID [2022-04-14 16:01:50,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} #108#return; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} call #t~ret9 := main(); {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} #94#return; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:50,282 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} #96#return; {7713#true} is VALID [2022-04-14 16:01:50,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {7766#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:01:50,285 INFO L290 TraceCheckUtils]: 23: Hoare triple {7776#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,287 INFO L290 TraceCheckUtils]: 27: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,287 INFO L290 TraceCheckUtils]: 28: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,288 INFO L290 TraceCheckUtils]: 30: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,288 INFO L272 TraceCheckUtils]: 32: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:50,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:50,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:50,289 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:50,289 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} #98#return; {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-14 16:01:50,290 INFO L272 TraceCheckUtils]: 37: Hoare triple {7789#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:50,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:50,290 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7714#false} is VALID [2022-04-14 16:01:50,290 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} assume !false; {7714#false} is VALID [2022-04-14 16:01:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:50,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:50,469 INFO L290 TraceCheckUtils]: 40: Hoare triple {7714#false} assume !false; {7714#false} is VALID [2022-04-14 16:01:50,469 INFO L290 TraceCheckUtils]: 39: Hoare triple {7836#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7714#false} is VALID [2022-04-14 16:01:50,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7836#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:50,470 INFO L272 TraceCheckUtils]: 37: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {7832#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:50,471 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {7713#true} {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:50,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:50,471 INFO L290 TraceCheckUtils]: 33: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:50,471 INFO L272 TraceCheckUtils]: 32: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:50,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,472 INFO L290 TraceCheckUtils]: 30: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,472 INFO L290 TraceCheckUtils]: 28: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,472 INFO L290 TraceCheckUtils]: 27: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,473 INFO L290 TraceCheckUtils]: 26: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,473 INFO L290 TraceCheckUtils]: 25: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:50,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:51,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {7852#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:01:51,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:01:51,498 INFO L290 TraceCheckUtils]: 21: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:01:51,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:01:51,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {7895#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:01:51,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:51,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {7713#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {7908#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:01:51,500 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7713#true} {7713#true} #96#return; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L272 TraceCheckUtils]: 11: Hoare triple {7713#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7713#true} {7713#true} #94#return; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {7713#true} assume !(0 == ~cond); {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {7713#true} ~cond := #in~cond; {7713#true} is VALID [2022-04-14 16:01:51,500 INFO L272 TraceCheckUtils]: 6: Hoare triple {7713#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {7713#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {7713#true} call #t~ret9 := main(); {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7713#true} {7713#true} #108#return; {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {7713#true} assume true; {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {7713#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {7713#true} call ULTIMATE.init(); {7713#true} is VALID [2022-04-14 16:01:51,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:01:51,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:51,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972068698] [2022-04-14 16:01:51,501 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:51,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885735675] [2022-04-14 16:01:51,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885735675] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:51,501 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:51,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-14 16:01:51,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617957210] [2022-04-14 16:01:51,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:51,502 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-14 16:01:51,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:51,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 16:01:51,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:51,610 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-14 16:01:51,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-14 16:01:51,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-14 16:01:51,611 INFO L87 Difference]: Start difference. First operand 230 states and 324 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 16:01:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:53,657 INFO L93 Difference]: Finished difference Result 392 states and 578 transitions. [2022-04-14 16:01:53,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-14 16:01:53,657 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-14 16:01:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 16:01:53,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-14 16:01:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 16:01:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 252 transitions. [2022-04-14 16:01:53,662 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 252 transitions. [2022-04-14 16:01:54,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:54,263 INFO L225 Difference]: With dead ends: 392 [2022-04-14 16:01:54,263 INFO L226 Difference]: Without dead ends: 390 [2022-04-14 16:01:54,263 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-14 16:01:54,264 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 157 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:54,264 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 334 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-14 16:01:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-04-14 16:01:54,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2022-04-14 16:01:54,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:54,785 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-14 16:01:54,786 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-14 16:01:54,786 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-14 16:01:54,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:54,798 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-14 16:01:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-14 16:01:54,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:54,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:54,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-14 16:01:54,800 INFO L87 Difference]: Start difference. First operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) Second operand 390 states. [2022-04-14 16:01:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:54,810 INFO L93 Difference]: Finished difference Result 390 states and 576 transitions. [2022-04-14 16:01:54,811 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 576 transitions. [2022-04-14 16:01:54,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:54,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:54,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:54,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 266 states have (on average 1.4248120300751879) internal successors, (379), 267 states have internal predecessors, (379), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-14 16:01:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 563 transitions. [2022-04-14 16:01:54,823 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 563 transitions. Word has length 41 [2022-04-14 16:01:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:54,823 INFO L478 AbstractCegarLoop]: Abstraction has 377 states and 563 transitions. [2022-04-14 16:01:54,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-14 16:01:54,823 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 563 transitions. [2022-04-14 16:01:54,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-14 16:01:54,824 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:54,824 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:54,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:55,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-14 16:01:55,041 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:55,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:55,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1943393983, now seen corresponding path program 1 times [2022-04-14 16:01:55,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:55,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464960788] [2022-04-14 16:01:55,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:55,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:55,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:55,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517325428] [2022-04-14 16:01:55,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:55,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:55,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:55,054 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:55,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-14 16:01:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:55,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:01:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:55,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:55,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {9884#true} call ULTIMATE.init(); {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {9884#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9884#true} {9884#true} #108#return; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L272 TraceCheckUtils]: 4: Hoare triple {9884#true} call #t~ret9 := main(); {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 5: Hoare triple {9884#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L272 TraceCheckUtils]: 6: Hoare triple {9884#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9884#true} {9884#true} #94#return; {9884#true} is VALID [2022-04-14 16:01:55,266 INFO L272 TraceCheckUtils]: 11: Hoare triple {9884#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9884#true} {9884#true} #96#return; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {9884#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {9884#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {9884#true} assume !!(#t~post6 < 100);havoc #t~post6; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {9884#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {9884#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {9884#true} assume !!(#t~post7 < 100);havoc #t~post7; {9884#true} is VALID [2022-04-14 16:01:55,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {9884#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,268 INFO L272 TraceCheckUtils]: 25: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {9884#true} is VALID [2022-04-14 16:01:55,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-14 16:01:55,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-14 16:01:55,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,269 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #98#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,269 INFO L272 TraceCheckUtils]: 30: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {9884#true} is VALID [2022-04-14 16:01:55,269 INFO L290 TraceCheckUtils]: 31: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-14 16:01:55,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-14 16:01:55,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,270 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #100#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,270 INFO L272 TraceCheckUtils]: 35: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {9884#true} is VALID [2022-04-14 16:01:55,270 INFO L290 TraceCheckUtils]: 36: Hoare triple {9884#true} ~cond := #in~cond; {9884#true} is VALID [2022-04-14 16:01:55,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {9884#true} assume !(0 == ~cond); {9884#true} is VALID [2022-04-14 16:01:55,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {9884#true} assume true; {9884#true} is VALID [2022-04-14 16:01:55,271 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9884#true} {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} #102#return; {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-14 16:01:55,271 INFO L272 TraceCheckUtils]: 40: Hoare triple {9955#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:01:55,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {10010#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10014#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:01:55,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {10014#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9885#false} is VALID [2022-04-14 16:01:55,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {9885#false} assume !false; {9885#false} is VALID [2022-04-14 16:01:55,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 16:01:55,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:01:55,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:55,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464960788] [2022-04-14 16:01:55,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:55,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517325428] [2022-04-14 16:01:55,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517325428] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:01:55,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:01:55,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:01:55,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868646593] [2022-04-14 16:01:55,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:01:55,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-14 16:01:55,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:55,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 16:01:55,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:55,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:01:55,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:55,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:01:55,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:01:55,297 INFO L87 Difference]: Start difference. First operand 377 states and 563 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 16:01:56,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:56,166 INFO L93 Difference]: Finished difference Result 566 states and 887 transitions. [2022-04-14 16:01:56,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:01:56,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 44 [2022-04-14 16:01:56,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 16:01:56,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 16:01:56,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 16:01:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2022-04-14 16:01:56,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2022-04-14 16:01:56,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:56,223 INFO L225 Difference]: With dead ends: 566 [2022-04-14 16:01:56,223 INFO L226 Difference]: Without dead ends: 564 [2022-04-14 16:01:56,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:01:56,226 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:56,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:01:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-04-14 16:01:56,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2022-04-14 16:01:56,883 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:01:56,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-14 16:01:56,884 INFO L74 IsIncluded]: Start isIncluded. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-14 16:01:56,885 INFO L87 Difference]: Start difference. First operand 564 states. Second operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-14 16:01:56,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:56,923 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-14 16:01:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-14 16:01:56,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:56,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:56,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-14 16:01:56,927 INFO L87 Difference]: Start difference. First operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 564 states. [2022-04-14 16:01:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:56,947 INFO L93 Difference]: Finished difference Result 564 states and 884 transitions. [2022-04-14 16:01:56,947 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2022-04-14 16:01:56,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:01:56,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:01:56,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:01:56,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:01:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 307 states have (on average 1.4267100977198697) internal successors, (438), 327 states have internal predecessors, (438), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-14 16:01:56,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 774 transitions. [2022-04-14 16:01:56,975 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 774 transitions. Word has length 44 [2022-04-14 16:01:56,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:01:56,976 INFO L478 AbstractCegarLoop]: Abstraction has 495 states and 774 transitions. [2022-04-14 16:01:56,976 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-14 16:01:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 774 transitions. [2022-04-14 16:01:56,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-14 16:01:56,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:01:56,976 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:01:56,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-14 16:01:57,193 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-14 16:01:57,193 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:01:57,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:01:57,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1018638220, now seen corresponding path program 1 times [2022-04-14 16:01:57,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:01:57,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221592857] [2022-04-14 16:01:57,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:01:57,211 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:01:57,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1612501147] [2022-04-14 16:01:57,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:01:57,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:01:57,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:01:57,224 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:01:57,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-14 16:01:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:57,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 16:01:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:01:57,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:01:57,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} call ULTIMATE.init(); {12762#true} is VALID [2022-04-14 16:01:57,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12770#(<= ~counter~0 0)} {12762#true} #108#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {12770#(<= ~counter~0 0)} call #t~ret9 := main(); {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {12770#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,374 INFO L272 TraceCheckUtils]: 6: Hoare triple {12770#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {12770#(<= ~counter~0 0)} ~cond := #in~cond; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {12770#(<= ~counter~0 0)} assume !(0 == ~cond); {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,375 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} #94#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,375 INFO L272 TraceCheckUtils]: 11: Hoare triple {12770#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {12770#(<= ~counter~0 0)} ~cond := #in~cond; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {12770#(<= ~counter~0 0)} assume !(0 == ~cond); {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {12770#(<= ~counter~0 0)} assume true; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,376 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12770#(<= ~counter~0 0)} {12770#(<= ~counter~0 0)} #96#return; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {12770#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12770#(<= ~counter~0 0)} is VALID [2022-04-14 16:01:57,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {12770#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12819#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:57,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {12819#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {12819#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:57,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {12819#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12819#(<= ~counter~0 1)} is VALID [2022-04-14 16:01:57,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {12819#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12829#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:57,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {12829#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {12829#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:57,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {12829#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {12829#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:57,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {12829#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12829#(<= ~counter~0 2)} is VALID [2022-04-14 16:01:57,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {12829#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12842#(<= ~counter~0 3)} is VALID [2022-04-14 16:01:57,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {12842#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {12842#(<= ~counter~0 3)} is VALID [2022-04-14 16:01:57,378 INFO L290 TraceCheckUtils]: 26: Hoare triple {12842#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12842#(<= ~counter~0 3)} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {12842#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12852#(<= |main_#t~post7| 3)} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {12852#(<= |main_#t~post7| 3)} assume !(#t~post7 < 100);havoc #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} assume !!(#t~post6 < 100);havoc #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} assume !(#t~post7 < 100);havoc #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} assume !(#t~post6 < 100);havoc #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,380 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12763#false} is VALID [2022-04-14 16:01:57,380 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} ~cond := #in~cond; {12763#false} is VALID [2022-04-14 16:01:57,380 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} assume 0 == ~cond; {12763#false} is VALID [2022-04-14 16:01:57,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} assume !false; {12763#false} is VALID [2022-04-14 16:01:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 16:01:57,380 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {12763#false} assume !false; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {12763#false} assume 0 == ~cond; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {12763#false} ~cond := #in~cond; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L272 TraceCheckUtils]: 38: Hoare triple {12763#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 37: Hoare triple {12763#false} assume !(#t~post6 < 100);havoc #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {12763#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {12763#false} assume !(#t~post7 < 100);havoc #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,510 INFO L290 TraceCheckUtils]: 33: Hoare triple {12763#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 32: Hoare triple {12763#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 31: Hoare triple {12763#false} assume !!(#t~post6 < 100);havoc #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 30: Hoare triple {12763#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 29: Hoare triple {12763#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 28: Hoare triple {12934#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {12763#false} is VALID [2022-04-14 16:01:57,511 INFO L290 TraceCheckUtils]: 27: Hoare triple {12938#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12934#(< |main_#t~post7| 100)} is VALID [2022-04-14 16:01:57,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {12938#(< ~counter~0 100)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12938#(< ~counter~0 100)} is VALID [2022-04-14 16:01:57,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {12938#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {12938#(< ~counter~0 100)} is VALID [2022-04-14 16:01:57,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {12948#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12938#(< ~counter~0 100)} is VALID [2022-04-14 16:01:57,513 INFO L290 TraceCheckUtils]: 23: Hoare triple {12948#(< ~counter~0 99)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {12948#(< ~counter~0 99)} is VALID [2022-04-14 16:01:57,513 INFO L290 TraceCheckUtils]: 22: Hoare triple {12948#(< ~counter~0 99)} assume !(~c~0 >= ~b~0); {12948#(< ~counter~0 99)} is VALID [2022-04-14 16:01:57,513 INFO L290 TraceCheckUtils]: 21: Hoare triple {12948#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {12948#(< ~counter~0 99)} is VALID [2022-04-14 16:01:57,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {12961#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12948#(< ~counter~0 99)} is VALID [2022-04-14 16:01:57,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {12961#(< ~counter~0 98)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {12961#(< ~counter~0 98)} is VALID [2022-04-14 16:01:57,514 INFO L290 TraceCheckUtils]: 18: Hoare triple {12961#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {12961#(< ~counter~0 98)} is VALID [2022-04-14 16:01:57,515 INFO L290 TraceCheckUtils]: 17: Hoare triple {12971#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12961#(< ~counter~0 98)} is VALID [2022-04-14 16:01:57,515 INFO L290 TraceCheckUtils]: 16: Hoare triple {12971#(< ~counter~0 97)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,515 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12762#true} {12971#(< ~counter~0 97)} #96#return; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {12762#true} assume true; {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {12762#true} assume !(0 == ~cond); {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {12762#true} ~cond := #in~cond; {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L272 TraceCheckUtils]: 11: Hoare triple {12971#(< ~counter~0 97)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12762#true} {12971#(< ~counter~0 97)} #94#return; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {12762#true} assume true; {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {12762#true} assume !(0 == ~cond); {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {12762#true} ~cond := #in~cond; {12762#true} is VALID [2022-04-14 16:01:57,516 INFO L272 TraceCheckUtils]: 6: Hoare triple {12971#(< ~counter~0 97)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {12762#true} is VALID [2022-04-14 16:01:57,517 INFO L290 TraceCheckUtils]: 5: Hoare triple {12971#(< ~counter~0 97)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {12971#(< ~counter~0 97)} call #t~ret9 := main(); {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12971#(< ~counter~0 97)} {12762#true} #108#return; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {12971#(< ~counter~0 97)} assume true; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {12762#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12971#(< ~counter~0 97)} is VALID [2022-04-14 16:01:57,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {12762#true} call ULTIMATE.init(); {12762#true} is VALID [2022-04-14 16:01:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 16:01:57,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:01:57,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221592857] [2022-04-14 16:01:57,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:01:57,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612501147] [2022-04-14 16:01:57,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612501147] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:01:57,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:01:57,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-14 16:01:57,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341929649] [2022-04-14 16:01:57,519 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:01:57,519 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-14 16:01:57,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:01:57,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:57,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:57,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-14 16:01:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:01:57,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-14 16:01:57,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-14 16:01:57,558 INFO L87 Difference]: Start difference. First operand 495 states and 774 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:59,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:01:59,150 INFO L93 Difference]: Finished difference Result 1127 states and 1721 transitions. [2022-04-14 16:01:59,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-14 16:01:59,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-14 16:01:59,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:01:59,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-14 16:01:59,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:01:59,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 224 transitions. [2022-04-14 16:01:59,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 224 transitions. [2022-04-14 16:01:59,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:01:59,330 INFO L225 Difference]: With dead ends: 1127 [2022-04-14 16:01:59,330 INFO L226 Difference]: Without dead ends: 770 [2022-04-14 16:01:59,332 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2022-04-14 16:01:59,333 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 156 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:01:59,333 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 390 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:01:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-04-14 16:02:00,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 736. [2022-04-14 16:02:00,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:02:00,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-14 16:02:00,353 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-14 16:02:00,354 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-14 16:02:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:00,382 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-14 16:02:00,382 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-14 16:02:00,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:00,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:00,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-14 16:02:00,385 INFO L87 Difference]: Start difference. First operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) Second operand 770 states. [2022-04-14 16:02:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:00,413 INFO L93 Difference]: Finished difference Result 770 states and 1118 transitions. [2022-04-14 16:02:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1118 transitions. [2022-04-14 16:02:00,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:00,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:00,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:02:00,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:02:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 471 states have (on average 1.3630573248407643) internal successors, (642), 495 states have internal predecessors, (642), 224 states have call successors, (224), 41 states have call predecessors, (224), 40 states have return successors, (219), 199 states have call predecessors, (219), 219 states have call successors, (219) [2022-04-14 16:02:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1085 transitions. [2022-04-14 16:02:00,445 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1085 transitions. Word has length 42 [2022-04-14 16:02:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:02:00,446 INFO L478 AbstractCegarLoop]: Abstraction has 736 states and 1085 transitions. [2022-04-14 16:02:00,446 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1085 transitions. [2022-04-14 16:02:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 16:02:00,446 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:02:00,447 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:02:00,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-14 16:02:00,662 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-14 16:02:00,663 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:02:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:02:00,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2064241646, now seen corresponding path program 1 times [2022-04-14 16:02:00,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:02:00,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479108115] [2022-04-14 16:02:00,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:02:00,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:02:00,681 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:02:00,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1817071827] [2022-04-14 16:02:00,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:02:00,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:02:00,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:02:00,682 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:02:00,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-14 16:02:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:02:00,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-14 16:02:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:02:00,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:02:00,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-14 16:02:00,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,925 INFO L290 TraceCheckUtils]: 2: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,926 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17418#(<= ~counter~0 0)} {17410#true} #108#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,926 INFO L272 TraceCheckUtils]: 4: Hoare triple {17418#(<= ~counter~0 0)} call #t~ret9 := main(); {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {17418#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,927 INFO L272 TraceCheckUtils]: 6: Hoare triple {17418#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {17418#(<= ~counter~0 0)} ~cond := #in~cond; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {17418#(<= ~counter~0 0)} assume !(0 == ~cond); {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,928 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} #94#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,928 INFO L272 TraceCheckUtils]: 11: Hoare triple {17418#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {17418#(<= ~counter~0 0)} ~cond := #in~cond; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {17418#(<= ~counter~0 0)} assume !(0 == ~cond); {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {17418#(<= ~counter~0 0)} assume true; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,930 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17418#(<= ~counter~0 0)} {17418#(<= ~counter~0 0)} #96#return; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {17418#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17418#(<= ~counter~0 0)} is VALID [2022-04-14 16:02:00,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {17418#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17467#(<= ~counter~0 1)} is VALID [2022-04-14 16:02:00,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {17467#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17467#(<= ~counter~0 1)} is VALID [2022-04-14 16:02:00,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {17467#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17467#(<= ~counter~0 1)} is VALID [2022-04-14 16:02:00,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {17467#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17477#(<= ~counter~0 2)} is VALID [2022-04-14 16:02:00,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {17477#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {17477#(<= ~counter~0 2)} is VALID [2022-04-14 16:02:00,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {17477#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {17477#(<= ~counter~0 2)} is VALID [2022-04-14 16:02:00,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {17477#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17477#(<= ~counter~0 2)} is VALID [2022-04-14 16:02:00,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {17477#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17490#(<= ~counter~0 3)} is VALID [2022-04-14 16:02:00,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {17490#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {17490#(<= ~counter~0 3)} is VALID [2022-04-14 16:02:00,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {17490#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17490#(<= ~counter~0 3)} is VALID [2022-04-14 16:02:00,934 INFO L290 TraceCheckUtils]: 27: Hoare triple {17490#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17500#(<= ~counter~0 4)} is VALID [2022-04-14 16:02:00,934 INFO L290 TraceCheckUtils]: 28: Hoare triple {17500#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {17500#(<= ~counter~0 4)} is VALID [2022-04-14 16:02:00,934 INFO L290 TraceCheckUtils]: 29: Hoare triple {17500#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17500#(<= ~counter~0 4)} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 30: Hoare triple {17500#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17510#(<= |main_#t~post8| 4)} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 31: Hoare triple {17510#(<= |main_#t~post8| 4)} assume !(#t~post8 < 100);havoc #t~post8; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} assume !!(#t~post7 < 100);havoc #t~post7; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} assume !(~c~0 >= ~b~0); {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17411#false} is VALID [2022-04-14 16:02:00,935 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} assume !(#t~post6 < 100);havoc #t~post6; {17411#false} is VALID [2022-04-14 16:02:00,936 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {17411#false} is VALID [2022-04-14 16:02:00,936 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} ~cond := #in~cond; {17411#false} is VALID [2022-04-14 16:02:00,936 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} assume 0 == ~cond; {17411#false} is VALID [2022-04-14 16:02:00,936 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-14 16:02:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:02:00,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:02:01,177 INFO L290 TraceCheckUtils]: 42: Hoare triple {17411#false} assume !false; {17411#false} is VALID [2022-04-14 16:02:01,177 INFO L290 TraceCheckUtils]: 41: Hoare triple {17411#false} assume 0 == ~cond; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {17411#false} ~cond := #in~cond; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L272 TraceCheckUtils]: 39: Hoare triple {17411#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {17411#false} assume !(#t~post6 < 100);havoc #t~post6; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {17411#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {17411#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {17411#false} assume !(~c~0 >= ~b~0); {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {17411#false} assume !!(#t~post7 < 100);havoc #t~post7; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {17411#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {17411#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {17411#false} is VALID [2022-04-14 16:02:01,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {17580#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {17411#false} is VALID [2022-04-14 16:02:01,179 INFO L290 TraceCheckUtils]: 30: Hoare triple {17584#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {17580#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:02:01,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {17584#(< ~counter~0 100)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {17584#(< ~counter~0 100)} is VALID [2022-04-14 16:02:01,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {17584#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {17584#(< ~counter~0 100)} is VALID [2022-04-14 16:02:01,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {17594#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17584#(< ~counter~0 100)} is VALID [2022-04-14 16:02:01,180 INFO L290 TraceCheckUtils]: 26: Hoare triple {17594#(< ~counter~0 99)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17594#(< ~counter~0 99)} is VALID [2022-04-14 16:02:01,180 INFO L290 TraceCheckUtils]: 25: Hoare triple {17594#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {17594#(< ~counter~0 99)} is VALID [2022-04-14 16:02:01,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {17604#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17594#(< ~counter~0 99)} is VALID [2022-04-14 16:02:01,181 INFO L290 TraceCheckUtils]: 23: Hoare triple {17604#(< ~counter~0 98)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {17604#(< ~counter~0 98)} is VALID [2022-04-14 16:02:01,181 INFO L290 TraceCheckUtils]: 22: Hoare triple {17604#(< ~counter~0 98)} assume !(~c~0 >= ~b~0); {17604#(< ~counter~0 98)} is VALID [2022-04-14 16:02:01,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {17604#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {17604#(< ~counter~0 98)} is VALID [2022-04-14 16:02:01,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {17617#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17604#(< ~counter~0 98)} is VALID [2022-04-14 16:02:01,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {17617#(< ~counter~0 97)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {17617#(< ~counter~0 97)} is VALID [2022-04-14 16:02:01,182 INFO L290 TraceCheckUtils]: 18: Hoare triple {17617#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {17617#(< ~counter~0 97)} is VALID [2022-04-14 16:02:01,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {17627#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17617#(< ~counter~0 97)} is VALID [2022-04-14 16:02:01,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {17627#(< ~counter~0 96)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,183 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17410#true} {17627#(< ~counter~0 96)} #96#return; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-14 16:02:01,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-14 16:02:01,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-14 16:02:01,183 INFO L272 TraceCheckUtils]: 11: Hoare triple {17627#(< ~counter~0 96)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17410#true} is VALID [2022-04-14 16:02:01,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17410#true} {17627#(< ~counter~0 96)} #94#return; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {17410#true} assume true; {17410#true} is VALID [2022-04-14 16:02:01,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {17410#true} assume !(0 == ~cond); {17410#true} is VALID [2022-04-14 16:02:01,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {17410#true} ~cond := #in~cond; {17410#true} is VALID [2022-04-14 16:02:01,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {17627#(< ~counter~0 96)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {17410#true} is VALID [2022-04-14 16:02:01,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {17627#(< ~counter~0 96)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {17627#(< ~counter~0 96)} call #t~ret9 := main(); {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17627#(< ~counter~0 96)} {17410#true} #108#return; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {17627#(< ~counter~0 96)} assume true; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {17410#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17627#(< ~counter~0 96)} is VALID [2022-04-14 16:02:01,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {17410#true} call ULTIMATE.init(); {17410#true} is VALID [2022-04-14 16:02:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-14 16:02:01,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:02:01,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479108115] [2022-04-14 16:02:01,185 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:02:01,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817071827] [2022-04-14 16:02:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817071827] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:02:01,186 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:02:01,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-14 16:02:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520640675] [2022-04-14 16:02:01,186 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:02:01,186 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-14 16:02:01,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:02:01,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:01,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:02:01,215 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-14 16:02:01,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:02:01,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-14 16:02:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-14 16:02:01,216 INFO L87 Difference]: Start difference. First operand 736 states and 1085 transitions. Second operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:03,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:03,348 INFO L93 Difference]: Finished difference Result 1597 states and 2379 transitions. [2022-04-14 16:02:03,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-14 16:02:03,349 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 43 [2022-04-14 16:02:03,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:02:03,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:03,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-14 16:02:03,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 281 transitions. [2022-04-14 16:02:03,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 281 transitions. [2022-04-14 16:02:03,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:02:03,606 INFO L225 Difference]: With dead ends: 1597 [2022-04-14 16:02:03,606 INFO L226 Difference]: Without dead ends: 1119 [2022-04-14 16:02:03,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=144, Invalid=276, Unknown=0, NotChecked=0, Total=420 [2022-04-14 16:02:03,610 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 237 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:02:03,611 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 405 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:02:03,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2022-04-14 16:02:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1072. [2022-04-14 16:02:05,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:02:05,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-14 16:02:05,556 INFO L74 IsIncluded]: Start isIncluded. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-14 16:02:05,557 INFO L87 Difference]: Start difference. First operand 1119 states. Second operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-14 16:02:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:05,601 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-14 16:02:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-14 16:02:05,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:05,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:05,605 INFO L74 IsIncluded]: Start isIncluded. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-14 16:02:05,606 INFO L87 Difference]: Start difference. First operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) Second operand 1119 states. [2022-04-14 16:02:05,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:05,648 INFO L93 Difference]: Finished difference Result 1119 states and 1584 transitions. [2022-04-14 16:02:05,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 1584 transitions. [2022-04-14 16:02:05,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:05,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:05,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:02:05,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:02:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1072 states, 697 states have (on average 1.3113342898134863) internal successors, (914), 730 states have internal predecessors, (914), 318 states have call successors, (318), 57 states have call predecessors, (318), 56 states have return successors, (311), 284 states have call predecessors, (311), 311 states have call successors, (311) [2022-04-14 16:02:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1072 states to 1072 states and 1543 transitions. [2022-04-14 16:02:05,705 INFO L78 Accepts]: Start accepts. Automaton has 1072 states and 1543 transitions. Word has length 43 [2022-04-14 16:02:05,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:02:05,705 INFO L478 AbstractCegarLoop]: Abstraction has 1072 states and 1543 transitions. [2022-04-14 16:02:05,705 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-14 16:02:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1072 states and 1543 transitions. [2022-04-14 16:02:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-14 16:02:05,706 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:02:05,706 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:02:05,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-14 16:02:05,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:02:05,922 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:02:05,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:02:05,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1262965884, now seen corresponding path program 2 times [2022-04-14 16:02:05,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:02:05,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153502151] [2022-04-14 16:02:05,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:02:05,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:02:05,935 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:02:05,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1933857666] [2022-04-14 16:02:05,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:02:05,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:02:05,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:02:05,938 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:02:05,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-14 16:02:06,007 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:02:06,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:02:06,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:02:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:02:06,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:02:06,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {23972#true} call ULTIMATE.init(); {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {23972#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23972#true} {23972#true} #108#return; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {23972#true} call #t~ret9 := main(); {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {23972#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {23972#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {23972#true} ~cond := #in~cond; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {23972#true} assume !(0 == ~cond); {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23972#true} {23972#true} #94#return; {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L272 TraceCheckUtils]: 11: Hoare triple {23972#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {23972#true} is VALID [2022-04-14 16:02:06,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {23972#true} ~cond := #in~cond; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 13: Hoare triple {23972#true} assume !(0 == ~cond); {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {23972#true} assume true; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23972#true} {23972#true} #96#return; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {23972#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {23972#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {23972#true} assume !!(#t~post6 < 100);havoc #t~post6; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {23972#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {23972#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {23972#true} assume !!(#t~post7 < 100);havoc #t~post7; {23972#true} is VALID [2022-04-14 16:02:06,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {23972#true} assume !(~c~0 >= ~b~0); {24043#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-14 16:02:06,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {24043#(not (<= main_~b~0 main_~c~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 16:02:06,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {24047#(< main_~b~0 main_~a~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 16:02:06,129 INFO L290 TraceCheckUtils]: 25: Hoare triple {24047#(< main_~b~0 main_~a~0)} assume !!(#t~post6 < 100);havoc #t~post6; {24047#(< main_~b~0 main_~a~0)} is VALID [2022-04-14 16:02:06,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {24047#(< main_~b~0 main_~a~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 16:02:06,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {24057#(< main_~b~0 main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 16:02:06,130 INFO L290 TraceCheckUtils]: 28: Hoare triple {24057#(< main_~b~0 main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {24057#(< main_~b~0 main_~c~0)} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {24057#(< main_~b~0 main_~c~0)} assume !(~c~0 >= ~b~0); {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {23973#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {23973#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 32: Hoare triple {23973#false} assume !!(#t~post6 < 100);havoc #t~post6; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 33: Hoare triple {23973#false} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {23973#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 35: Hoare triple {23973#false} assume !!(#t~post7 < 100);havoc #t~post7; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 36: Hoare triple {23973#false} assume !(~c~0 >= ~b~0); {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 37: Hoare triple {23973#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 38: Hoare triple {23973#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23973#false} is VALID [2022-04-14 16:02:06,131 INFO L290 TraceCheckUtils]: 39: Hoare triple {23973#false} assume !(#t~post6 < 100);havoc #t~post6; {23973#false} is VALID [2022-04-14 16:02:06,132 INFO L272 TraceCheckUtils]: 40: Hoare triple {23973#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {23973#false} is VALID [2022-04-14 16:02:06,132 INFO L290 TraceCheckUtils]: 41: Hoare triple {23973#false} ~cond := #in~cond; {23973#false} is VALID [2022-04-14 16:02:06,132 INFO L290 TraceCheckUtils]: 42: Hoare triple {23973#false} assume 0 == ~cond; {23973#false} is VALID [2022-04-14 16:02:06,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {23973#false} assume !false; {23973#false} is VALID [2022-04-14 16:02:06,132 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-14 16:02:06,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:02:06,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:02:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153502151] [2022-04-14 16:02:06,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:02:06,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933857666] [2022-04-14 16:02:06,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933857666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:02:06,132 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:02:06,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:02:06,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834901578] [2022-04-14 16:02:06,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:02:06,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-14 16:02:06,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:02:06,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:02:06,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:02:06,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:02:06,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:02:06,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:02:06,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:02:06,160 INFO L87 Difference]: Start difference. First operand 1072 states and 1543 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:02:08,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:08,593 INFO L93 Difference]: Finished difference Result 1700 states and 2539 transitions. [2022-04-14 16:02:08,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:02:08,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2022-04-14 16:02:08,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:02:08,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:02:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-14 16:02:08,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:02:08,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-04-14 16:02:08,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-04-14 16:02:08,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:02:08,745 INFO L225 Difference]: With dead ends: 1700 [2022-04-14 16:02:08,746 INFO L226 Difference]: Without dead ends: 1234 [2022-04-14 16:02:08,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-14 16:02:08,747 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 29 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 16:02:08,747 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 170 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 16:02:08,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2022-04-14 16:02:10,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 995. [2022-04-14 16:02:10,703 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:02:10,704 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-14 16:02:10,705 INFO L74 IsIncluded]: Start isIncluded. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-14 16:02:10,706 INFO L87 Difference]: Start difference. First operand 1234 states. Second operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-14 16:02:10,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:10,762 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-14 16:02:10,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-14 16:02:10,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:10,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:10,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-14 16:02:10,767 INFO L87 Difference]: Start difference. First operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) Second operand 1234 states. [2022-04-14 16:02:10,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:02:10,854 INFO L93 Difference]: Finished difference Result 1234 states and 1815 transitions. [2022-04-14 16:02:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1815 transitions. [2022-04-14 16:02:10,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:02:10,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:02:10,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:02:10,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:02:10,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 660 states have (on average 1.3015151515151515) internal successors, (859), 690 states have internal predecessors, (859), 278 states have call successors, (278), 57 states have call predecessors, (278), 56 states have return successors, (271), 247 states have call predecessors, (271), 271 states have call successors, (271) [2022-04-14 16:02:10,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1408 transitions. [2022-04-14 16:02:10,908 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1408 transitions. Word has length 44 [2022-04-14 16:02:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:02:10,908 INFO L478 AbstractCegarLoop]: Abstraction has 995 states and 1408 transitions. [2022-04-14 16:02:10,908 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 16:02:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1408 transitions. [2022-04-14 16:02:10,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 16:02:10,909 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:02:10,909 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:02:10,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-14 16:02:11,123 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-14 16:02:11,123 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:02:11,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:02:11,123 INFO L85 PathProgramCache]: Analyzing trace with hash 958119025, now seen corresponding path program 1 times [2022-04-14 16:02:11,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:02:11,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585444997] [2022-04-14 16:02:11,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:02:11,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:02:11,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:02:11,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1767891727] [2022-04-14 16:02:11,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:02:11,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:02:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:02:11,160 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:02:11,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-14 16:02:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:02:11,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-14 16:02:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:02:11,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:02:11,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} call ULTIMATE.init(); {30652#true} is VALID [2022-04-14 16:02:11,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} #108#return; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} call #t~ret9 := main(); {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} #94#return; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:11,990 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} #96#return; {30652#true} is VALID [2022-04-14 16:02:11,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {30705#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,993 INFO L290 TraceCheckUtils]: 22: Hoare triple {30715#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,993 INFO L290 TraceCheckUtils]: 23: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,993 INFO L290 TraceCheckUtils]: 24: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,994 INFO L272 TraceCheckUtils]: 25: Hoare triple {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,994 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} ~cond := #in~cond; {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:02:11,994 INFO L290 TraceCheckUtils]: 27: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:11,994 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:11,995 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30725#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,995 INFO L272 TraceCheckUtils]: 30: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,995 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} ~cond := #in~cond; {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:02:11,995 INFO L290 TraceCheckUtils]: 32: Hoare triple {30738#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:11,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:11,996 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,996 INFO L272 TraceCheckUtils]: 35: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,996 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:11,996 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:11,996 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:11,997 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,997 INFO L272 TraceCheckUtils]: 40: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:11,997 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:11,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:11,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:11,997 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,998 INFO L290 TraceCheckUtils]: 45: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,998 INFO L290 TraceCheckUtils]: 46: Hoare triple {30749#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,999 INFO L290 TraceCheckUtils]: 47: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,999 INFO L290 TraceCheckUtils]: 48: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:11,999 INFO L290 TraceCheckUtils]: 49: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:02:12,000 INFO L290 TraceCheckUtils]: 50: Hoare triple {30801#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:02:12,000 INFO L290 TraceCheckUtils]: 51: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:02:12,000 INFO L290 TraceCheckUtils]: 52: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:02:12,001 INFO L290 TraceCheckUtils]: 53: Hoare triple {30814#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} assume !(0 != ~b~0); {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-14 16:02:12,001 INFO L272 TraceCheckUtils]: 54: Hoare triple {30824#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:02:12,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:02:12,015 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30653#false} is VALID [2022-04-14 16:02:12,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} assume !false; {30653#false} is VALID [2022-04-14 16:02:12,016 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 16:02:12,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:02:58,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {30653#false} assume !false; {30653#false} is VALID [2022-04-14 16:02:58,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {30832#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {30653#false} is VALID [2022-04-14 16:02:58,100 INFO L290 TraceCheckUtils]: 55: Hoare triple {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {30832#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:02:58,101 INFO L272 TraceCheckUtils]: 54: Hoare triple {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {30828#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:02:58,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {30848#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:02:58,102 INFO L290 TraceCheckUtils]: 52: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:02:58,102 INFO L290 TraceCheckUtils]: 51: Hoare triple {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:02:58,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {30852#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:02:58,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,271 INFO L290 TraceCheckUtils]: 48: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,302 INFO L290 TraceCheckUtils]: 46: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {30862#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,303 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:58,303 INFO L290 TraceCheckUtils]: 42: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:58,303 INFO L290 TraceCheckUtils]: 41: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:58,303 INFO L272 TraceCheckUtils]: 40: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,304 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {30652#true} {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:58,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:58,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:58,304 INFO L272 TraceCheckUtils]: 35: Hoare triple {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,305 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {30875#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:58,306 INFO L290 TraceCheckUtils]: 32: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:58,306 INFO L290 TraceCheckUtils]: 31: Hoare triple {30652#true} ~cond := #in~cond; {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:02:58,306 INFO L272 TraceCheckUtils]: 30: Hoare triple {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,307 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {30912#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:58,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {30742#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:02:58,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {30652#true} ~cond := #in~cond; {30922#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:02:58,308 INFO L272 TraceCheckUtils]: 25: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,309 INFO L290 TraceCheckUtils]: 24: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,309 INFO L290 TraceCheckUtils]: 23: Hoare triple {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,310 INFO L290 TraceCheckUtils]: 22: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {30929#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:02:58,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-14 16:02:58,312 INFO L290 TraceCheckUtils]: 20: Hoare triple {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-14 16:02:58,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {30652#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {30951#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-14 16:02:58,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {30652#true} assume !!(#t~post6 < 100);havoc #t~post6; {30652#true} is VALID [2022-04-14 16:02:58,312 INFO L290 TraceCheckUtils]: 17: Hoare triple {30652#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 16: Hoare triple {30652#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {30652#true} {30652#true} #96#return; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L272 TraceCheckUtils]: 11: Hoare triple {30652#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {30652#true} {30652#true} #94#return; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {30652#true} assume !(0 == ~cond); {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {30652#true} ~cond := #in~cond; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L272 TraceCheckUtils]: 6: Hoare triple {30652#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {30652#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {30652#true} call #t~ret9 := main(); {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30652#true} {30652#true} #108#return; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {30652#true} assume true; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {30652#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {30652#true} is VALID [2022-04-14 16:02:58,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {30652#true} call ULTIMATE.init(); {30652#true} is VALID [2022-04-14 16:02:58,314 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-14 16:02:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:02:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585444997] [2022-04-14 16:02:58,314 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:02:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767891727] [2022-04-14 16:02:58,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767891727] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:02:58,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:02:58,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-14 16:02:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116975537] [2022-04-14 16:02:58,315 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:02:58,315 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-14 16:02:58,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:02:58,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-14 16:02:58,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:02:58,548 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-14 16:02:58,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:02:58,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-14 16:02:58,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-14 16:02:58,549 INFO L87 Difference]: Start difference. First operand 995 states and 1408 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-14 16:03:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:16,533 INFO L93 Difference]: Finished difference Result 1412 states and 2014 transitions. [2022-04-14 16:03:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-14 16:03:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-14 16:03:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:03:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-14 16:03:16,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-14 16:03:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-14 16:03:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 308 transitions. [2022-04-14 16:03:16,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 308 transitions. [2022-04-14 16:03:21,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:21,313 INFO L225 Difference]: With dead ends: 1412 [2022-04-14 16:03:21,313 INFO L226 Difference]: Without dead ends: 1404 [2022-04-14 16:03:21,314 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-14 16:03:21,314 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 166 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 1343 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 1343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-04-14 16:03:21,314 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 669 Invalid, 1579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 1343 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-04-14 16:03:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2022-04-14 16:03:23,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 1226. [2022-04-14 16:03:23,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:03:23,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:03:23,642 INFO L74 IsIncluded]: Start isIncluded. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:03:23,643 INFO L87 Difference]: Start difference. First operand 1404 states. Second operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:03:23,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:23,707 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-14 16:03:23,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-14 16:03:23,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:23,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:23,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-14 16:03:23,713 INFO L87 Difference]: Start difference. First operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) Second operand 1404 states. [2022-04-14 16:03:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:23,776 INFO L93 Difference]: Finished difference Result 1404 states and 1984 transitions. [2022-04-14 16:03:23,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1984 transitions. [2022-04-14 16:03:23,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:23,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:23,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:03:23,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:03:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1226 states, 845 states have (on average 1.2970414201183431) internal successors, (1096), 864 states have internal predecessors, (1096), 308 states have call successors, (308), 73 states have call predecessors, (308), 72 states have return successors, (303), 288 states have call predecessors, (303), 303 states have call successors, (303) [2022-04-14 16:03:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1707 transitions. [2022-04-14 16:03:23,843 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1707 transitions. Word has length 58 [2022-04-14 16:03:23,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:03:23,843 INFO L478 AbstractCegarLoop]: Abstraction has 1226 states and 1707 transitions. [2022-04-14 16:03:23,843 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-14 16:03:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1707 transitions. [2022-04-14 16:03:23,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-14 16:03:23,844 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:03:23,844 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:03:23,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-14 16:03:24,060 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-14 16:03:24,060 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:03:24,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:03:24,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1288112160, now seen corresponding path program 1 times [2022-04-14 16:03:24,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:03:24,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359426091] [2022-04-14 16:03:24,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:24,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:03:24,072 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:03:24,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1100689570] [2022-04-14 16:03:24,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:24,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:24,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:03:24,073 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:03:24,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-14 16:03:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:24,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 16:03:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:24,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:03:24,469 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} call ULTIMATE.init(); {37759#true} is VALID [2022-04-14 16:03:24,469 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,470 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37767#(<= ~counter~0 0)} {37759#true} #108#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,470 INFO L272 TraceCheckUtils]: 4: Hoare triple {37767#(<= ~counter~0 0)} call #t~ret9 := main(); {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {37767#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,471 INFO L272 TraceCheckUtils]: 6: Hoare triple {37767#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {37767#(<= ~counter~0 0)} ~cond := #in~cond; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {37767#(<= ~counter~0 0)} assume !(0 == ~cond); {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,472 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} #94#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,473 INFO L272 TraceCheckUtils]: 11: Hoare triple {37767#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {37767#(<= ~counter~0 0)} ~cond := #in~cond; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {37767#(<= ~counter~0 0)} assume !(0 == ~cond); {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {37767#(<= ~counter~0 0)} assume true; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37767#(<= ~counter~0 0)} {37767#(<= ~counter~0 0)} #96#return; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {37767#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {37767#(<= ~counter~0 0)} is VALID [2022-04-14 16:03:24,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {37767#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37816#(<= ~counter~0 1)} is VALID [2022-04-14 16:03:24,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {37816#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {37816#(<= ~counter~0 1)} is VALID [2022-04-14 16:03:24,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {37816#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37816#(<= ~counter~0 1)} is VALID [2022-04-14 16:03:24,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {37816#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37826#(<= ~counter~0 2)} is VALID [2022-04-14 16:03:24,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {37826#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {37826#(<= ~counter~0 2)} is VALID [2022-04-14 16:03:24,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {37826#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {37826#(<= ~counter~0 2)} is VALID [2022-04-14 16:03:24,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {37826#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37826#(<= ~counter~0 2)} is VALID [2022-04-14 16:03:24,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {37826#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37839#(<= ~counter~0 3)} is VALID [2022-04-14 16:03:24,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {37839#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {37839#(<= ~counter~0 3)} is VALID [2022-04-14 16:03:24,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {37839#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {37839#(<= ~counter~0 3)} is VALID [2022-04-14 16:03:24,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {37839#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37849#(<= ~counter~0 4)} is VALID [2022-04-14 16:03:24,480 INFO L290 TraceCheckUtils]: 28: Hoare triple {37849#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {37849#(<= ~counter~0 4)} is VALID [2022-04-14 16:03:24,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {37849#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {37849#(<= ~counter~0 4)} is VALID [2022-04-14 16:03:24,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {37849#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,481 INFO L290 TraceCheckUtils]: 31: Hoare triple {37859#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,481 INFO L272 TraceCheckUtils]: 32: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,482 INFO L290 TraceCheckUtils]: 33: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,482 INFO L290 TraceCheckUtils]: 34: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,482 INFO L290 TraceCheckUtils]: 35: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,483 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #98#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,483 INFO L272 TraceCheckUtils]: 37: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,484 INFO L290 TraceCheckUtils]: 39: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,484 INFO L290 TraceCheckUtils]: 40: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,485 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #100#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,486 INFO L272 TraceCheckUtils]: 42: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,486 INFO L290 TraceCheckUtils]: 43: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,486 INFO L290 TraceCheckUtils]: 44: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,486 INFO L290 TraceCheckUtils]: 45: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,487 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #102#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,488 INFO L272 TraceCheckUtils]: 47: Hoare triple {37859#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,488 INFO L290 TraceCheckUtils]: 48: Hoare triple {37859#(<= ~counter~0 5)} ~cond := #in~cond; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,488 INFO L290 TraceCheckUtils]: 49: Hoare triple {37859#(<= ~counter~0 5)} assume !(0 == ~cond); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,488 INFO L290 TraceCheckUtils]: 50: Hoare triple {37859#(<= ~counter~0 5)} assume true; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,489 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37859#(<= ~counter~0 5)} {37859#(<= ~counter~0 5)} #104#return; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {37859#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {37859#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37859#(<= ~counter~0 5)} is VALID [2022-04-14 16:03:24,490 INFO L290 TraceCheckUtils]: 54: Hoare triple {37859#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37932#(<= ~counter~0 6)} is VALID [2022-04-14 16:03:24,490 INFO L290 TraceCheckUtils]: 55: Hoare triple {37932#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {37932#(<= ~counter~0 6)} is VALID [2022-04-14 16:03:24,490 INFO L290 TraceCheckUtils]: 56: Hoare triple {37932#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {37932#(<= ~counter~0 6)} is VALID [2022-04-14 16:03:24,491 INFO L290 TraceCheckUtils]: 57: Hoare triple {37932#(<= ~counter~0 6)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37932#(<= ~counter~0 6)} is VALID [2022-04-14 16:03:24,491 INFO L290 TraceCheckUtils]: 58: Hoare triple {37932#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37945#(<= |main_#t~post6| 6)} is VALID [2022-04-14 16:03:24,491 INFO L290 TraceCheckUtils]: 59: Hoare triple {37945#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {37760#false} is VALID [2022-04-14 16:03:24,491 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {37760#false} is VALID [2022-04-14 16:03:24,492 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} ~cond := #in~cond; {37760#false} is VALID [2022-04-14 16:03:24,492 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} assume 0 == ~cond; {37760#false} is VALID [2022-04-14 16:03:24,492 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} assume !false; {37760#false} is VALID [2022-04-14 16:03:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 16:03:24,492 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:03:24,852 INFO L290 TraceCheckUtils]: 63: Hoare triple {37760#false} assume !false; {37760#false} is VALID [2022-04-14 16:03:24,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {37760#false} assume 0 == ~cond; {37760#false} is VALID [2022-04-14 16:03:24,853 INFO L290 TraceCheckUtils]: 61: Hoare triple {37760#false} ~cond := #in~cond; {37760#false} is VALID [2022-04-14 16:03:24,853 INFO L272 TraceCheckUtils]: 60: Hoare triple {37760#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {37760#false} is VALID [2022-04-14 16:03:24,853 INFO L290 TraceCheckUtils]: 59: Hoare triple {37973#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {37760#false} is VALID [2022-04-14 16:03:24,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {37977#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37973#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:03:24,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {37977#(< ~counter~0 100)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {37977#(< ~counter~0 100)} is VALID [2022-04-14 16:03:24,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {37977#(< ~counter~0 100)} assume !(~c~0 >= ~b~0); {37977#(< ~counter~0 100)} is VALID [2022-04-14 16:03:24,854 INFO L290 TraceCheckUtils]: 55: Hoare triple {37977#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {37977#(< ~counter~0 100)} is VALID [2022-04-14 16:03:24,855 INFO L290 TraceCheckUtils]: 54: Hoare triple {37990#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {37977#(< ~counter~0 100)} is VALID [2022-04-14 16:03:24,855 INFO L290 TraceCheckUtils]: 53: Hoare triple {37990#(< ~counter~0 99)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,855 INFO L290 TraceCheckUtils]: 52: Hoare triple {37990#(< ~counter~0 99)} assume !(~c~0 >= 2 * ~v~0); {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,855 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {37759#true} {37990#(< ~counter~0 99)} #104#return; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L272 TraceCheckUtils]: 47: Hoare triple {37990#(< ~counter~0 99)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {37759#true} {37990#(< ~counter~0 99)} #102#return; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 45: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 44: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L290 TraceCheckUtils]: 43: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,856 INFO L272 TraceCheckUtils]: 42: Hoare triple {37990#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {37759#true} {37990#(< ~counter~0 99)} #100#return; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 38: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L272 TraceCheckUtils]: 37: Hoare triple {37990#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {37759#true} {37990#(< ~counter~0 99)} #98#return; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 35: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 34: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L290 TraceCheckUtils]: 33: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,857 INFO L272 TraceCheckUtils]: 32: Hoare triple {37990#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {37990#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {38063#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {37990#(< ~counter~0 99)} is VALID [2022-04-14 16:03:24,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {38063#(< ~counter~0 98)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {38063#(< ~counter~0 98)} is VALID [2022-04-14 16:03:24,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {38063#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {38063#(< ~counter~0 98)} is VALID [2022-04-14 16:03:24,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {38073#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38063#(< ~counter~0 98)} is VALID [2022-04-14 16:03:24,863 INFO L290 TraceCheckUtils]: 26: Hoare triple {38073#(< ~counter~0 97)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {38073#(< ~counter~0 97)} is VALID [2022-04-14 16:03:24,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {38073#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {38073#(< ~counter~0 97)} is VALID [2022-04-14 16:03:24,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {38083#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38073#(< ~counter~0 97)} is VALID [2022-04-14 16:03:24,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {38083#(< ~counter~0 96)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {38083#(< ~counter~0 96)} is VALID [2022-04-14 16:03:24,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {38083#(< ~counter~0 96)} assume !(~c~0 >= ~b~0); {38083#(< ~counter~0 96)} is VALID [2022-04-14 16:03:24,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {38083#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {38083#(< ~counter~0 96)} is VALID [2022-04-14 16:03:24,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {38096#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38083#(< ~counter~0 96)} is VALID [2022-04-14 16:03:24,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {38096#(< ~counter~0 95)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {38096#(< ~counter~0 95)} is VALID [2022-04-14 16:03:24,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {38096#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {38096#(< ~counter~0 95)} is VALID [2022-04-14 16:03:24,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {38106#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38096#(< ~counter~0 95)} is VALID [2022-04-14 16:03:24,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {38106#(< ~counter~0 94)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37759#true} {38106#(< ~counter~0 94)} #96#return; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,881 INFO L290 TraceCheckUtils]: 14: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {38106#(< ~counter~0 94)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37759#true} {38106#(< ~counter~0 94)} #94#return; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {37759#true} assume true; {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {37759#true} assume !(0 == ~cond); {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {37759#true} ~cond := #in~cond; {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {38106#(< ~counter~0 94)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {37759#true} is VALID [2022-04-14 16:03:24,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {38106#(< ~counter~0 94)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {38106#(< ~counter~0 94)} call #t~ret9 := main(); {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38106#(< ~counter~0 94)} {37759#true} #108#return; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {38106#(< ~counter~0 94)} assume true; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {37759#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {38106#(< ~counter~0 94)} is VALID [2022-04-14 16:03:24,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {37759#true} call ULTIMATE.init(); {37759#true} is VALID [2022-04-14 16:03:24,884 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 16:03:24,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:03:24,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359426091] [2022-04-14 16:03:24,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:03:24,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100689570] [2022-04-14 16:03:24,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100689570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:03:24,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:03:24,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-14 16:03:24,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778098971] [2022-04-14 16:03:24,885 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:03:24,885 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-14 16:03:24,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:03:24,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-14 16:03:24,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:24,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-14 16:03:24,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:03:24,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-14 16:03:24,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-14 16:03:24,947 INFO L87 Difference]: Start difference. First operand 1226 states and 1707 transitions. Second operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-14 16:03:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:28,591 INFO L93 Difference]: Finished difference Result 2565 states and 3679 transitions. [2022-04-14 16:03:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-14 16:03:28,591 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) Word has length 64 [2022-04-14 16:03:28,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:03:28,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-14 16:03:28,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 367 transitions. [2022-04-14 16:03:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-14 16:03:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 367 transitions. [2022-04-14 16:03:28,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 367 transitions. [2022-04-14 16:03:28,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 367 edges. 367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:29,026 INFO L225 Difference]: With dead ends: 2565 [2022-04-14 16:03:29,026 INFO L226 Difference]: Without dead ends: 2543 [2022-04-14 16:03:29,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=287, Invalid=525, Unknown=0, NotChecked=0, Total=812 [2022-04-14 16:03:29,027 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 337 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:03:29,027 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [337 Valid, 502 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-14 16:03:29,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2022-04-14 16:03:32,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2406. [2022-04-14 16:03:32,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:03:32,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:32,674 INFO L74 IsIncluded]: Start isIncluded. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:32,676 INFO L87 Difference]: Start difference. First operand 2543 states. Second operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:32,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:32,869 INFO L93 Difference]: Finished difference Result 2543 states and 3572 transitions. [2022-04-14 16:03:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3572 transitions. [2022-04-14 16:03:32,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:32,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:32,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2543 states. [2022-04-14 16:03:32,880 INFO L87 Difference]: Start difference. First operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2543 states. [2022-04-14 16:03:33,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:33,060 INFO L93 Difference]: Finished difference Result 2543 states and 3572 transitions. [2022-04-14 16:03:33,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2543 states and 3572 transitions. [2022-04-14 16:03:33,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:33,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:33,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:03:33,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:03:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 1658 states have (on average 1.3094089264173703) internal successors, (2171), 1717 states have internal predecessors, (2171), 631 states have call successors, (631), 117 states have call predecessors, (631), 116 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 3425 transitions. [2022-04-14 16:03:33,302 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 3425 transitions. Word has length 64 [2022-04-14 16:03:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:03:33,303 INFO L478 AbstractCegarLoop]: Abstraction has 2406 states and 3425 transitions. [2022-04-14 16:03:33,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.8333333333333335) internal successors, (69), 18 states have internal predecessors, (69), 6 states have call successors, (16), 5 states have call predecessors, (16), 4 states have return successors, (14), 4 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-14 16:03:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 3425 transitions. [2022-04-14 16:03:33,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-14 16:03:33,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:03:33,304 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:03:33,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-14 16:03:33,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-14 16:03:33,517 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:03:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:03:33,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1156119236, now seen corresponding path program 1 times [2022-04-14 16:03:33,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:03:33,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798885886] [2022-04-14 16:03:33,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:33,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:03:33,530 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:03:33,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360314461] [2022-04-14 16:03:33,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:33,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:33,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:03:33,535 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:03:33,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-14 16:03:33,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:33,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-14 16:03:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:33,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:03:33,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {50605#true} call ULTIMATE.init(); {50605#true} is VALID [2022-04-14 16:03:33,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {50605#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {50605#true} is VALID [2022-04-14 16:03:33,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50605#true} {50605#true} #108#return; {50605#true} is VALID [2022-04-14 16:03:33,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {50605#true} call #t~ret9 := main(); {50605#true} is VALID [2022-04-14 16:03:33,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {50605#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L272 TraceCheckUtils]: 6: Hoare triple {50605#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50605#true} {50605#true} #94#return; {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {50605#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {50605#true} ~cond := #in~cond; {50646#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {50646#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {50650#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:03:33,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {50650#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {50650#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:03:33,814 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {50650#(not (= |assume_abort_if_not_#in~cond| 0))} {50605#true} #96#return; {50657#(<= 1 main_~y~0)} is VALID [2022-04-14 16:03:33,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {50657#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {50661#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(#t~post6 < 100);havoc #t~post6; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {50661#(<= 1 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,815 INFO L290 TraceCheckUtils]: 21: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(#t~post7 < 100);havoc #t~post7; {50661#(<= 1 main_~b~0)} is VALID [2022-04-14 16:03:33,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {50661#(<= 1 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,816 INFO L290 TraceCheckUtils]: 24: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(#t~post8 < 100);havoc #t~post8; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,816 INFO L272 TraceCheckUtils]: 25: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,816 INFO L290 TraceCheckUtils]: 27: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,816 INFO L290 TraceCheckUtils]: 28: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #98#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,817 INFO L272 TraceCheckUtils]: 30: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L290 TraceCheckUtils]: 31: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #100#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,817 INFO L272 TraceCheckUtils]: 35: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,817 INFO L290 TraceCheckUtils]: 36: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L290 TraceCheckUtils]: 37: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L290 TraceCheckUtils]: 38: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #102#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,818 INFO L272 TraceCheckUtils]: 40: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L290 TraceCheckUtils]: 42: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,818 INFO L290 TraceCheckUtils]: 43: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,819 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {50605#true} {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} #104#return; {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {50680#(and (= main_~b~0 main_~v~0) (= main_~d~0 1) (<= 1 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 47: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} assume !!(#t~post8 < 100);havoc #t~post8; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,820 INFO L272 TraceCheckUtils]: 48: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 49: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 51: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #98#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,820 INFO L272 TraceCheckUtils]: 53: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 55: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,821 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #100#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,821 INFO L272 TraceCheckUtils]: 58: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:33,821 INFO L290 TraceCheckUtils]: 59: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:33,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:33,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:33,821 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {50605#true} {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} #102#return; {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} is VALID [2022-04-14 16:03:33,822 INFO L272 TraceCheckUtils]: 63: Hoare triple {50750#(and (= main_~v~0 (* main_~b~0 2)) (= main_~d~0 2) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:03:33,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:03:33,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {50809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50606#false} is VALID [2022-04-14 16:03:33,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {50606#false} assume !false; {50606#false} is VALID [2022-04-14 16:03:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-04-14 16:03:33,823 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:03:34,016 INFO L290 TraceCheckUtils]: 66: Hoare triple {50606#false} assume !false; {50606#false} is VALID [2022-04-14 16:03:34,017 INFO L290 TraceCheckUtils]: 65: Hoare triple {50809#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {50606#false} is VALID [2022-04-14 16:03:34,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {50809#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:03:34,017 INFO L272 TraceCheckUtils]: 63: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50805#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:03:34,017 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 61: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 60: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 59: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L272 TraceCheckUtils]: 58: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L290 TraceCheckUtils]: 54: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,018 INFO L272 TraceCheckUtils]: 53: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,019 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,019 INFO L290 TraceCheckUtils]: 51: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,019 INFO L290 TraceCheckUtils]: 50: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,019 INFO L290 TraceCheckUtils]: 49: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,019 INFO L272 TraceCheckUtils]: 48: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,019 INFO L290 TraceCheckUtils]: 47: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 100);havoc #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,019 INFO L290 TraceCheckUtils]: 46: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,021 INFO L290 TraceCheckUtils]: 45: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,021 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #104#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 43: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 42: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 41: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L272 TraceCheckUtils]: 40: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #102#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 38: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 37: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L290 TraceCheckUtils]: 36: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,022 INFO L272 TraceCheckUtils]: 35: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #100#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L272 TraceCheckUtils]: 30: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {50605#true} {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #98#return; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,024 INFO L272 TraceCheckUtils]: 25: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} assume !!(#t~post8 < 100);havoc #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {50605#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {50825#(= main_~v~0 (* main_~d~0 main_~b~0))} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {50605#true} assume !!(#t~post7 < 100);havoc #t~post7; {50605#true} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {50605#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {50605#true} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {50605#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {50605#true} is VALID [2022-04-14 16:03:34,024 INFO L290 TraceCheckUtils]: 18: Hoare triple {50605#true} assume !!(#t~post6 < 100);havoc #t~post6; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 17: Hoare triple {50605#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 16: Hoare triple {50605#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {50605#true} {50605#true} #96#return; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {50605#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {50605#true} {50605#true} #94#return; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {50605#true} assume !(0 == ~cond); {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {50605#true} ~cond := #in~cond; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L272 TraceCheckUtils]: 6: Hoare triple {50605#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {50605#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {50605#true} call #t~ret9 := main(); {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50605#true} {50605#true} #108#return; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 2: Hoare triple {50605#true} assume true; {50605#true} is VALID [2022-04-14 16:03:34,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {50605#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {50605#true} is VALID [2022-04-14 16:03:34,026 INFO L272 TraceCheckUtils]: 0: Hoare triple {50605#true} call ULTIMATE.init(); {50605#true} is VALID [2022-04-14 16:03:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-04-14 16:03:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:03:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798885886] [2022-04-14 16:03:34,026 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:03:34,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360314461] [2022-04-14 16:03:34,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360314461] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 16:03:34,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 16:03:34,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-14 16:03:34,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580892878] [2022-04-14 16:03:34,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:03:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-14 16:03:34,027 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:03:34,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:03:34,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:34,046 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:03:34,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:03:34,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:03:34,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-14 16:03:34,047 INFO L87 Difference]: Start difference. First operand 2406 states and 3425 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:03:37,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:37,340 INFO L93 Difference]: Finished difference Result 2467 states and 3485 transitions. [2022-04-14 16:03:37,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:03:37,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2022-04-14 16:03:37,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:03:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:03:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-14 16:03:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:03:37,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2022-04-14 16:03:37,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 56 transitions. [2022-04-14 16:03:37,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:37,660 INFO L225 Difference]: With dead ends: 2467 [2022-04-14 16:03:37,661 INFO L226 Difference]: Without dead ends: 2465 [2022-04-14 16:03:37,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 122 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-04-14 16:03:37,662 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:03:37,662 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 147 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:03:37,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2465 states. [2022-04-14 16:03:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2465 to 2442. [2022-04-14 16:03:41,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:03:41,423 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:41,426 INFO L74 IsIncluded]: Start isIncluded. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:41,428 INFO L87 Difference]: Start difference. First operand 2465 states. Second operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:41,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:41,592 INFO L93 Difference]: Finished difference Result 2465 states and 3473 transitions. [2022-04-14 16:03:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3473 transitions. [2022-04-14 16:03:41,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:41,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:41,602 INFO L74 IsIncluded]: Start isIncluded. First operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2465 states. [2022-04-14 16:03:41,604 INFO L87 Difference]: Start difference. First operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) Second operand 2465 states. [2022-04-14 16:03:41,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:41,778 INFO L93 Difference]: Finished difference Result 2465 states and 3473 transitions. [2022-04-14 16:03:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2465 states and 3473 transitions. [2022-04-14 16:03:41,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:41,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:41,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:03:41,785 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:03:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1685 states have (on average 1.3032640949554897) internal successors, (2196), 1744 states have internal predecessors, (2196), 631 states have call successors, (631), 126 states have call predecessors, (631), 125 states have return successors, (623), 571 states have call predecessors, (623), 623 states have call successors, (623) [2022-04-14 16:03:42,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 3450 transitions. [2022-04-14 16:03:42,035 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 3450 transitions. Word has length 67 [2022-04-14 16:03:42,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:03:42,036 INFO L478 AbstractCegarLoop]: Abstraction has 2442 states and 3450 transitions. [2022-04-14 16:03:42,037 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-14 16:03:42,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 3450 transitions. [2022-04-14 16:03:42,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-14 16:03:42,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:03:42,037 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:03:42,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-14 16:03:42,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:42,254 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:03:42,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:03:42,254 INFO L85 PathProgramCache]: Analyzing trace with hash -958869778, now seen corresponding path program 1 times [2022-04-14 16:03:42,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:03:42,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643731660] [2022-04-14 16:03:42,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:42,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:03:42,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:03:42,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [780867141] [2022-04-14 16:03:42,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:42,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:42,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:03:42,263 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:03:42,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-14 16:03:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:42,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-14 16:03:42,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:42,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:03:42,519 INFO L272 TraceCheckUtils]: 0: Hoare triple {63174#true} call ULTIMATE.init(); {63174#true} is VALID [2022-04-14 16:03:42,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {63174#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {63174#true} is VALID [2022-04-14 16:03:42,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63174#true} {63174#true} #108#return; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {63174#true} call #t~ret9 := main(); {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {63174#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {63174#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {63174#true} {63174#true} #94#return; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L272 TraceCheckUtils]: 11: Hoare triple {63174#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {63174#true} {63174#true} #96#return; {63174#true} is VALID [2022-04-14 16:03:42,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {63174#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 17: Hoare triple {63174#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {63174#true} assume !!(#t~post6 < 100);havoc #t~post6; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 19: Hoare triple {63174#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {63174#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 21: Hoare triple {63174#true} assume !!(#t~post7 < 100);havoc #t~post7; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 22: Hoare triple {63174#true} assume !(~c~0 >= ~b~0); {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {63174#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {63174#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {63174#true} assume !!(#t~post6 < 100);havoc #t~post6; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {63174#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {63174#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63174#true} is VALID [2022-04-14 16:03:42,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {63174#true} assume !!(#t~post7 < 100);havoc #t~post7; {63174#true} is VALID [2022-04-14 16:03:42,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {63174#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {63266#(<= main_~v~0 main_~b~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {63266#(<= main_~v~0 main_~b~0)} assume !!(#t~post8 < 100);havoc #t~post8; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,522 INFO L272 TraceCheckUtils]: 32: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,522 INFO L290 TraceCheckUtils]: 33: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,522 INFO L290 TraceCheckUtils]: 34: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,523 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #98#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,523 INFO L272 TraceCheckUtils]: 37: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,523 INFO L290 TraceCheckUtils]: 38: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,523 INFO L290 TraceCheckUtils]: 39: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,524 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #100#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,524 INFO L272 TraceCheckUtils]: 42: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,524 INFO L290 TraceCheckUtils]: 43: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,524 INFO L290 TraceCheckUtils]: 44: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,524 INFO L290 TraceCheckUtils]: 45: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,525 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #102#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,525 INFO L272 TraceCheckUtils]: 47: Hoare triple {63266#(<= main_~v~0 main_~b~0)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {63174#true} is VALID [2022-04-14 16:03:42,525 INFO L290 TraceCheckUtils]: 48: Hoare triple {63174#true} ~cond := #in~cond; {63174#true} is VALID [2022-04-14 16:03:42,525 INFO L290 TraceCheckUtils]: 49: Hoare triple {63174#true} assume !(0 == ~cond); {63174#true} is VALID [2022-04-14 16:03:42,525 INFO L290 TraceCheckUtils]: 50: Hoare triple {63174#true} assume true; {63174#true} is VALID [2022-04-14 16:03:42,526 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {63174#true} {63266#(<= main_~v~0 main_~b~0)} #104#return; {63266#(<= main_~v~0 main_~b~0)} is VALID [2022-04-14 16:03:42,526 INFO L290 TraceCheckUtils]: 52: Hoare triple {63266#(<= main_~v~0 main_~b~0)} assume !(~c~0 >= 2 * ~v~0); {63336#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} is VALID [2022-04-14 16:03:42,527 INFO L290 TraceCheckUtils]: 53: Hoare triple {63336#(and (<= main_~v~0 main_~b~0) (not (<= (* main_~v~0 2) main_~c~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-14 16:03:42,527 INFO L290 TraceCheckUtils]: 54: Hoare triple {63340#(< main_~c~0 main_~b~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-14 16:03:42,527 INFO L290 TraceCheckUtils]: 55: Hoare triple {63340#(< main_~c~0 main_~b~0)} assume !!(#t~post7 < 100);havoc #t~post7; {63340#(< main_~c~0 main_~b~0)} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 56: Hoare triple {63340#(< main_~c~0 main_~b~0)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 57: Hoare triple {63175#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 58: Hoare triple {63175#false} assume !!(#t~post8 < 100);havoc #t~post8; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L272 TraceCheckUtils]: 59: Hoare triple {63175#false} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 60: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 61: Hoare triple {63175#false} assume !(0 == ~cond); {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 62: Hoare triple {63175#false} assume true; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {63175#false} {63175#false} #98#return; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L272 TraceCheckUtils]: 64: Hoare triple {63175#false} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 65: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-14 16:03:42,528 INFO L290 TraceCheckUtils]: 66: Hoare triple {63175#false} assume !(0 == ~cond); {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L290 TraceCheckUtils]: 67: Hoare triple {63175#false} assume true; {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {63175#false} {63175#false} #100#return; {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L272 TraceCheckUtils]: 69: Hoare triple {63175#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L290 TraceCheckUtils]: 70: Hoare triple {63175#false} ~cond := #in~cond; {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L290 TraceCheckUtils]: 71: Hoare triple {63175#false} assume 0 == ~cond; {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L290 TraceCheckUtils]: 72: Hoare triple {63175#false} assume !false; {63175#false} is VALID [2022-04-14 16:03:42,529 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-04-14 16:03:42,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:03:42,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:03:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643731660] [2022-04-14 16:03:42,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:03:42,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [780867141] [2022-04-14 16:03:42,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [780867141] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:03:42,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:03:42,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:03:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650193069] [2022-04-14 16:03:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:03:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-14 16:03:42,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:03:42,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-14 16:03:42,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:42,570 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:03:42,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:03:42,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:03:42,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:03:42,570 INFO L87 Difference]: Start difference. First operand 2442 states and 3450 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-14 16:03:46,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:46,857 INFO L93 Difference]: Finished difference Result 4377 states and 6175 transitions. [2022-04-14 16:03:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 16:03:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 73 [2022-04-14 16:03:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:03:46,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-14 16:03:46,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-14 16:03:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-14 16:03:46,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 104 transitions. [2022-04-14 16:03:46,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 104 transitions. [2022-04-14 16:03:46,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:03:47,264 INFO L225 Difference]: With dead ends: 4377 [2022-04-14 16:03:47,265 INFO L226 Difference]: Without dead ends: 2578 [2022-04-14 16:03:47,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:03:47,286 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:03:47,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:03:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2578 states. [2022-04-14 16:03:50,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2578 to 2372. [2022-04-14 16:03:50,877 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:03:50,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-14 16:03:50,881 INFO L74 IsIncluded]: Start isIncluded. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-14 16:03:50,883 INFO L87 Difference]: Start difference. First operand 2578 states. Second operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-14 16:03:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:51,061 INFO L93 Difference]: Finished difference Result 2578 states and 3563 transitions. [2022-04-14 16:03:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3563 transitions. [2022-04-14 16:03:51,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:51,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:51,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) Second operand 2578 states. [2022-04-14 16:03:51,069 INFO L87 Difference]: Start difference. First operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) Second operand 2578 states. [2022-04-14 16:03:51,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:03:51,249 INFO L93 Difference]: Finished difference Result 2578 states and 3563 transitions. [2022-04-14 16:03:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 3563 transitions. [2022-04-14 16:03:51,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:03:51,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:03:51,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:03:51,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:03:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2372 states, 1689 states have (on average 1.2948490230905862) internal successors, (2187), 1720 states have internal predecessors, (2187), 559 states have call successors, (559), 124 states have call predecessors, (559), 123 states have return successors, (551), 527 states have call predecessors, (551), 551 states have call successors, (551) [2022-04-14 16:03:51,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2372 states to 2372 states and 3297 transitions. [2022-04-14 16:03:51,482 INFO L78 Accepts]: Start accepts. Automaton has 2372 states and 3297 transitions. Word has length 73 [2022-04-14 16:03:51,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:03:51,483 INFO L478 AbstractCegarLoop]: Abstraction has 2372 states and 3297 transitions. [2022-04-14 16:03:51,483 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-14 16:03:51,483 INFO L276 IsEmpty]: Start isEmpty. Operand 2372 states and 3297 transitions. [2022-04-14 16:03:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-14 16:03:51,483 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:03:51,483 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:03:51,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-14 16:03:51,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:51,699 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:03:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:03:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash -705069158, now seen corresponding path program 2 times [2022-04-14 16:03:51,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:03:51,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138305024] [2022-04-14 16:03:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:03:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:03:51,713 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:03:51,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [352607487] [2022-04-14 16:03:51,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:03:51,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:03:51,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:03:51,714 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:03:51,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-14 16:03:51,771 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:03:51,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:03:51,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 82 conjunts are in the unsatisfiable core [2022-04-14 16:03:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:03:51,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:03:53,385 INFO L272 TraceCheckUtils]: 0: Hoare triple {78332#true} call ULTIMATE.init(); {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {78332#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78332#true} {78332#true} #108#return; {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {78332#true} call #t~ret9 := main(); {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {78332#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L272 TraceCheckUtils]: 6: Hoare triple {78332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:03:53,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:03:53,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:03:53,386 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78332#true} {78332#true} #94#return; {78332#true} is VALID [2022-04-14 16:03:53,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {78332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {78332#true} ~cond := #in~cond; {78373#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 16:03:53,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {78373#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {78377#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:03:53,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {78377#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {78377#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 16:03:53,387 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78377#(not (= |assume_abort_if_not_#in~cond| 0))} {78332#true} #96#return; {78384#(<= 1 main_~y~0)} is VALID [2022-04-14 16:03:53,387 INFO L290 TraceCheckUtils]: 16: Hoare triple {78384#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,388 INFO L290 TraceCheckUtils]: 19: Hoare triple {78388#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {78398#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {78408#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {78408#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post6 < 100);havoc #t~post6; {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {78412#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post7 < 100);havoc #t~post7; {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {78422#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} assume !!(#t~post8 < 100);havoc #t~post8; {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} is VALID [2022-04-14 16:03:53,394 INFO L272 TraceCheckUtils]: 32: Hoare triple {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {78332#true} ~cond := #in~cond; {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:03:53,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:03:53,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:03:53,396 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78432#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0))} #98#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,396 INFO L272 TraceCheckUtils]: 37: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,396 INFO L290 TraceCheckUtils]: 38: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:03:53,396 INFO L290 TraceCheckUtils]: 39: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:03:53,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:03:53,397 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,397 INFO L272 TraceCheckUtils]: 42: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:03:53,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:03:53,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:03:53,398 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,398 INFO L272 TraceCheckUtils]: 47: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:03:53,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:03:53,398 INFO L290 TraceCheckUtils]: 50: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:03:53,399 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {78332#true} {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,400 INFO L290 TraceCheckUtils]: 52: Hoare triple {78456#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (<= 1 main_~y~0) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {78505#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {78505#(and (= main_~b~0 main_~v~0) (< main_~x~0 main_~c~0) (< main_~c~0 (* main_~v~0 2)) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,402 INFO L290 TraceCheckUtils]: 55: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:03:53,404 INFO L290 TraceCheckUtils]: 57: Hoare triple {78509#(and (< (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)) (* main_~b~0 2)) (= main_~s~0 0) (= main_~p~0 0) (< main_~x~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~k~0 1) (= main_~q~0 1) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* (- 1) main_~b~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,405 INFO L290 TraceCheckUtils]: 59: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,406 INFO L290 TraceCheckUtils]: 61: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,406 INFO L290 TraceCheckUtils]: 62: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,407 INFO L290 TraceCheckUtils]: 63: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,407 INFO L290 TraceCheckUtils]: 64: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:03:53,408 INFO L272 TraceCheckUtils]: 66: Hoare triple {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:03:53,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {78332#true} ~cond := #in~cond; {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:03:53,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {78445#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:03:53,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:03:53,409 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78522#(and (= main_~r~0 0) (= (+ main_~s~0 main_~r~0) 1) (< main_~x~0 main_~y~0) (< main_~y~0 (* main_~a~0 2)) (= (+ (* (- 1) main_~a~0) main_~y~0) main_~b~0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 main_~p~0) 0) (= main_~p~0 1))} #98#return; {78562#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} is VALID [2022-04-14 16:03:53,410 INFO L272 TraceCheckUtils]: 71: Hoare triple {78562#(and (< (* main_~b~0 2) main_~y~0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) main_~y~0)) (= main_~s~0 1) (< main_~x~0 main_~y~0) (= (+ main_~q~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:03:53,410 INFO L290 TraceCheckUtils]: 72: Hoare triple {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {78570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:03:53,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {78570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {78333#false} is VALID [2022-04-14 16:03:53,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {78333#false} assume !false; {78333#false} is VALID [2022-04-14 16:03:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 20 proven. 43 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-14 16:03:53,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:04:45,637 INFO L290 TraceCheckUtils]: 74: Hoare triple {78333#false} assume !false; {78333#false} is VALID [2022-04-14 16:04:45,637 INFO L290 TraceCheckUtils]: 73: Hoare triple {78570#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {78333#false} is VALID [2022-04-14 16:04:45,638 INFO L290 TraceCheckUtils]: 72: Hoare triple {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {78570#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:04:45,638 INFO L272 TraceCheckUtils]: 71: Hoare triple {78586#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78566#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:04:45,639 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #98#return; {78586#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:04:45,639 INFO L290 TraceCheckUtils]: 69: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:04:45,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:04:45,640 INFO L290 TraceCheckUtils]: 67: Hoare triple {78332#true} ~cond := #in~cond; {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:04:45,640 INFO L272 TraceCheckUtils]: 66: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post8 < 100);havoc #t~post8; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,641 INFO L290 TraceCheckUtils]: 64: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,641 INFO L290 TraceCheckUtils]: 63: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,642 INFO L290 TraceCheckUtils]: 62: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,642 INFO L290 TraceCheckUtils]: 61: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,642 INFO L290 TraceCheckUtils]: 60: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,643 INFO L290 TraceCheckUtils]: 59: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} assume !!(#t~post6 < 100);havoc #t~post6; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,643 INFO L290 TraceCheckUtils]: 58: Hoare triple {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {78590#(or (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))))} is VALID [2022-04-14 16:04:45,661 INFO L290 TraceCheckUtils]: 56: Hoare triple {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= ~b~0); {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,661 INFO L290 TraceCheckUtils]: 55: Hoare triple {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,662 INFO L290 TraceCheckUtils]: 54: Hoare triple {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,666 INFO L290 TraceCheckUtils]: 53: Hoare triple {78644#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {78631#(or (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,667 INFO L290 TraceCheckUtils]: 52: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !(~c~0 >= 2 * ~v~0); {78644#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,668 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #104#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,668 INFO L290 TraceCheckUtils]: 50: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,668 INFO L290 TraceCheckUtils]: 49: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:04:45,668 INFO L290 TraceCheckUtils]: 48: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:04:45,668 INFO L272 TraceCheckUtils]: 47: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,669 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #102#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,669 INFO L290 TraceCheckUtils]: 45: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:04:45,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:04:45,669 INFO L272 TraceCheckUtils]: 42: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,669 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {78332#true} {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #100#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:04:45,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:04:45,670 INFO L272 TraceCheckUtils]: 37: Hoare triple {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,671 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #98#return; {78648#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,671 INFO L290 TraceCheckUtils]: 35: Hoare triple {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:04:45,671 INFO L290 TraceCheckUtils]: 34: Hoare triple {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {78449#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:04:45,672 INFO L290 TraceCheckUtils]: 33: Hoare triple {78332#true} ~cond := #in~cond; {78600#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:04:45,672 INFO L272 TraceCheckUtils]: 32: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,672 INFO L290 TraceCheckUtils]: 31: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post8 < 100);havoc #t~post8; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {78697#(or (= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0))) (<= (* main_~v~0 2) main_~c~0) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} assume !!(#t~post7 < 100);havoc #t~post7; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {78332#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78719#(or (<= (* main_~b~0 2) main_~c~0) (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))))} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {78332#true} assume !!(#t~post6 < 100);havoc #t~post6; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {78332#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 23: Hoare triple {78332#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {78332#true} assume !(~c~0 >= ~b~0); {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {78332#true} assume !!(#t~post7 < 100);havoc #t~post7; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 20: Hoare triple {78332#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 19: Hoare triple {78332#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 18: Hoare triple {78332#true} assume !!(#t~post6 < 100);havoc #t~post6; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 17: Hoare triple {78332#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 16: Hoare triple {78332#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {78332#true} {78332#true} #96#return; {78332#true} is VALID [2022-04-14 16:04:45,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 13: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 12: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L272 TraceCheckUtils]: 11: Hoare triple {78332#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {78332#true} {78332#true} #94#return; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {78332#true} assume !(0 == ~cond); {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {78332#true} ~cond := #in~cond; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {78332#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {78332#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {78332#true} call #t~ret9 := main(); {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78332#true} {78332#true} #108#return; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {78332#true} assume true; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {78332#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {78332#true} is VALID [2022-04-14 16:04:45,677 INFO L272 TraceCheckUtils]: 0: Hoare triple {78332#true} call ULTIMATE.init(); {78332#true} is VALID [2022-04-14 16:04:45,678 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 36 proven. 21 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-04-14 16:04:45,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:04:45,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138305024] [2022-04-14 16:04:45,678 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:04:45,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352607487] [2022-04-14 16:04:45,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352607487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:04:45,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:04:45,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 28 [2022-04-14 16:04:45,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311552478] [2022-04-14 16:04:45,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:04:45,679 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-14 16:04:45,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:04:45,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 16:04:45,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:04:45,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-14 16:04:45,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:04:45,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-14 16:04:45,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-04-14 16:04:45,940 INFO L87 Difference]: Start difference. First operand 2372 states and 3297 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 16:05:04,212 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 16:05:06,737 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 16:05:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:05:24,935 INFO L93 Difference]: Finished difference Result 2869 states and 3894 transitions. [2022-04-14 16:05:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-14 16:05:24,936 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) Word has length 75 [2022-04-14 16:05:24,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:05:24,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 16:05:24,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 245 transitions. [2022-04-14 16:05:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 16:05:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 245 transitions. [2022-04-14 16:05:24,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 245 transitions. [2022-04-14 16:05:25,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:05:25,763 INFO L225 Difference]: With dead ends: 2869 [2022-04-14 16:05:25,763 INFO L226 Difference]: Without dead ends: 2863 [2022-04-14 16:05:25,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 130 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=469, Invalid=1981, Unknown=0, NotChecked=0, Total=2450 [2022-04-14 16:05:25,765 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 285 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 288 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 1616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2022-04-14 16:05:25,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 746 Invalid, 1616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1326 Invalid, 2 Unknown, 0 Unchecked, 14.3s Time] [2022-04-14 16:05:25,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2863 states. [2022-04-14 16:05:28,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2863 to 2736. [2022-04-14 16:05:28,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:05:28,600 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-14 16:05:28,602 INFO L74 IsIncluded]: Start isIncluded. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-14 16:05:28,605 INFO L87 Difference]: Start difference. First operand 2863 states. Second operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-14 16:05:28,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:05:28,836 INFO L93 Difference]: Finished difference Result 2863 states and 3880 transitions. [2022-04-14 16:05:28,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3880 transitions. [2022-04-14 16:05:28,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:05:28,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:05:28,844 INFO L74 IsIncluded]: Start isIncluded. First operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) Second operand 2863 states. [2022-04-14 16:05:28,846 INFO L87 Difference]: Start difference. First operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) Second operand 2863 states. [2022-04-14 16:05:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:05:29,067 INFO L93 Difference]: Finished difference Result 2863 states and 3880 transitions. [2022-04-14 16:05:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2863 states and 3880 transitions. [2022-04-14 16:05:29,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:05:29,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:05:29,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:05:29,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:05:29,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2736 states, 1985 states have (on average 1.2916876574307306) internal successors, (2564), 2026 states have internal predecessors, (2564), 594 states have call successors, (594), 158 states have call predecessors, (594), 156 states have return successors, (587), 551 states have call predecessors, (587), 587 states have call successors, (587) [2022-04-14 16:05:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2736 states to 2736 states and 3745 transitions. [2022-04-14 16:05:29,368 INFO L78 Accepts]: Start accepts. Automaton has 2736 states and 3745 transitions. Word has length 75 [2022-04-14 16:05:29,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:05:29,369 INFO L478 AbstractCegarLoop]: Abstraction has 2736 states and 3745 transitions. [2022-04-14 16:05:29,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 22 states have internal predecessors, (78), 9 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 6 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-14 16:05:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2736 states and 3745 transitions. [2022-04-14 16:05:29,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-14 16:05:29,369 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:05:29,369 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:05:29,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-14 16:05:29,585 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-14 16:05:29,586 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:05:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:05:29,586 INFO L85 PathProgramCache]: Analyzing trace with hash -1082523945, now seen corresponding path program 1 times [2022-04-14 16:05:29,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:05:29,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846929511] [2022-04-14 16:05:29,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:05:29,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:05:29,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:05:29,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [581275014] [2022-04-14 16:05:29,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:05:29,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:05:29,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:05:29,603 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:05:29,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-14 16:05:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:05:29,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 86 conjunts are in the unsatisfiable core [2022-04-14 16:05:29,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:05:29,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:05:31,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {92630#true} call ULTIMATE.init(); {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {92630#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92630#true} {92630#true} #108#return; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {92630#true} call #t~ret9 := main(); {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {92630#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L272 TraceCheckUtils]: 6: Hoare triple {92630#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 9: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92630#true} {92630#true} #94#return; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L272 TraceCheckUtils]: 11: Hoare triple {92630#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 12: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,255 INFO L290 TraceCheckUtils]: 13: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,256 INFO L290 TraceCheckUtils]: 14: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,256 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92630#true} {92630#true} #96#return; {92630#true} is VALID [2022-04-14 16:05:31,256 INFO L290 TraceCheckUtils]: 16: Hoare triple {92630#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 16:05:31,256 INFO L290 TraceCheckUtils]: 17: Hoare triple {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 16:05:31,256 INFO L290 TraceCheckUtils]: 18: Hoare triple {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} is VALID [2022-04-14 16:05:31,257 INFO L290 TraceCheckUtils]: 19: Hoare triple {92683#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 16:05:31,257 INFO L290 TraceCheckUtils]: 20: Hoare triple {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 16:05:31,257 INFO L290 TraceCheckUtils]: 21: Hoare triple {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !!(#t~post7 < 100);havoc #t~post7; {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 16:05:31,258 INFO L290 TraceCheckUtils]: 22: Hoare triple {92693#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} assume !(~c~0 >= ~b~0); {92703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} is VALID [2022-04-14 16:05:31,258 INFO L290 TraceCheckUtils]: 23: Hoare triple {92703#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (not (<= main_~b~0 main_~c~0)) (<= main_~p~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,259 INFO L290 TraceCheckUtils]: 24: Hoare triple {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,259 INFO L290 TraceCheckUtils]: 25: Hoare triple {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post6 < 100);havoc #t~post6; {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,259 INFO L290 TraceCheckUtils]: 26: Hoare triple {92707#(and (= main_~s~0 0) (= main_~p~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,260 INFO L290 TraceCheckUtils]: 27: Hoare triple {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,260 INFO L290 TraceCheckUtils]: 28: Hoare triple {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(#t~post7 < 100);havoc #t~post7; {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} is VALID [2022-04-14 16:05:31,260 INFO L290 TraceCheckUtils]: 29: Hoare triple {92717#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,261 INFO L290 TraceCheckUtils]: 30: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,261 INFO L290 TraceCheckUtils]: 31: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,261 INFO L272 TraceCheckUtils]: 32: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,261 INFO L290 TraceCheckUtils]: 33: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,261 INFO L290 TraceCheckUtils]: 34: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,261 INFO L290 TraceCheckUtils]: 35: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,262 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {92630#true} {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #98#return; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,262 INFO L272 TraceCheckUtils]: 37: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,262 INFO L290 TraceCheckUtils]: 38: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,262 INFO L290 TraceCheckUtils]: 39: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,262 INFO L290 TraceCheckUtils]: 40: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {92630#true} {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #100#return; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,263 INFO L272 TraceCheckUtils]: 42: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {92630#true} {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #102#return; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,263 INFO L272 TraceCheckUtils]: 47: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 48: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 49: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,264 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {92630#true} {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} #104#return; {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} is VALID [2022-04-14 16:05:31,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {92727#(and (= main_~b~0 main_~v~0) (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-14 16:05:31,265 INFO L290 TraceCheckUtils]: 53: Hoare triple {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-14 16:05:31,265 INFO L290 TraceCheckUtils]: 54: Hoare triple {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} assume !!(#t~post8 < 100);havoc #t~post8; {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} is VALID [2022-04-14 16:05:31,265 INFO L272 TraceCheckUtils]: 55: Hoare triple {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {92630#true} ~cond := #in~cond; {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:05:31,266 INFO L290 TraceCheckUtils]: 57: Hoare triple {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,266 INFO L290 TraceCheckUtils]: 58: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,267 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {92797#(and (= main_~c~0 main_~a~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (not (<= main_~a~0 main_~x~0)) (<= main_~q~0 1) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 main_~x~0) (= main_~d~0 2))} #98#return; {92821#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,267 INFO L272 TraceCheckUtils]: 60: Hoare triple {92821#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,267 INFO L290 TraceCheckUtils]: 61: Hoare triple {92630#true} ~cond := #in~cond; {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:05:31,268 INFO L290 TraceCheckUtils]: 62: Hoare triple {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,269 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {92821#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #100#return; {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,269 INFO L272 TraceCheckUtils]: 65: Hoare triple {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,269 INFO L290 TraceCheckUtils]: 66: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:05:31,269 INFO L290 TraceCheckUtils]: 67: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:05:31,269 INFO L290 TraceCheckUtils]: 68: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:05:31,269 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {92630#true} {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #102#return; {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,269 INFO L272 TraceCheckUtils]: 70: Hoare triple {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:05:31,270 INFO L290 TraceCheckUtils]: 71: Hoare triple {92630#true} ~cond := #in~cond; {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:05:31,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {92810#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,270 INFO L290 TraceCheckUtils]: 73: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:05:31,270 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #104#return; {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,271 INFO L290 TraceCheckUtils]: 75: Hoare triple {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= 2 * ~v~0); {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,272 INFO L290 TraceCheckUtils]: 76: Hoare triple {92837#(and (< main_~x~0 main_~c~0) (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~v~0 (* main_~b~0 2)) (<= (* main_~b~0 2) main_~c~0) (= main_~p~0 0) (= main_~k~0 0) (<= main_~q~0 1) (= main_~r~0 1) (= main_~b~0 main_~x~0) (= main_~d~0 2) (= main_~c~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,272 INFO L290 TraceCheckUtils]: 77: Hoare triple {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {92874#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (<= main_~q~0 1) (= main_~r~0 1) (< main_~x~0 (+ main_~c~0 (* main_~b~0 2))) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} assume !(~c~0 >= ~b~0); {92884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} is VALID [2022-04-14 16:05:31,274 INFO L290 TraceCheckUtils]: 80: Hoare triple {92884#(and (= main_~s~0 0) (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (= main_~p~0 0) (= main_~r~0 1) (<= 0 main_~c~0) (= main_~b~0 main_~x~0) (= main_~k~0 2) (< main_~c~0 main_~b~0) (= (+ main_~c~0 (* main_~b~0 2)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-14 16:05:31,275 INFO L290 TraceCheckUtils]: 81: Hoare triple {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-14 16:05:31,275 INFO L290 TraceCheckUtils]: 82: Hoare triple {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-14 16:05:31,275 INFO L290 TraceCheckUtils]: 83: Hoare triple {92888#(and (= main_~r~0 0) (= main_~b~0 (+ main_~y~0 (* (- 2) main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (<= (* 2 (* main_~p~0 main_~x~0)) main_~y~0) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} assume !(0 != ~b~0); {92898#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} is VALID [2022-04-14 16:05:31,277 INFO L272 TraceCheckUtils]: 84: Hoare triple {92898#(and (= main_~r~0 0) (= main_~y~0 (* 2 (* main_~p~0 main_~x~0))) (= main_~s~0 1) (< main_~y~0 (* 3 (* main_~p~0 main_~x~0))) (= main_~a~0 (* main_~p~0 main_~x~0)) (= main_~x~0 (* main_~p~0 main_~x~0)) (= (+ (* main_~p~0 2) main_~q~0) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92902#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:05:31,277 INFO L290 TraceCheckUtils]: 85: Hoare triple {92902#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92906#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:05:31,277 INFO L290 TraceCheckUtils]: 86: Hoare triple {92906#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92631#false} is VALID [2022-04-14 16:05:31,277 INFO L290 TraceCheckUtils]: 87: Hoare triple {92631#false} assume !false; {92631#false} is VALID [2022-04-14 16:05:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-04-14 16:05:31,278 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:06:46,966 INFO L290 TraceCheckUtils]: 87: Hoare triple {92631#false} assume !false; {92631#false} is VALID [2022-04-14 16:06:46,966 INFO L290 TraceCheckUtils]: 86: Hoare triple {92906#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92631#false} is VALID [2022-04-14 16:06:46,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {92902#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92906#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:06:46,967 INFO L272 TraceCheckUtils]: 84: Hoare triple {92922#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {92902#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:06:46,968 INFO L290 TraceCheckUtils]: 83: Hoare triple {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {92922#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:06:46,968 INFO L290 TraceCheckUtils]: 82: Hoare triple {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:06:46,968 INFO L290 TraceCheckUtils]: 81: Hoare triple {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:06:47,226 INFO L290 TraceCheckUtils]: 80: Hoare triple {92936#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {92926#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:06:47,226 INFO L290 TraceCheckUtils]: 79: Hoare triple {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {92936#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,227 INFO L290 TraceCheckUtils]: 78: Hoare triple {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,227 INFO L290 TraceCheckUtils]: 77: Hoare triple {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,746 INFO L290 TraceCheckUtils]: 76: Hoare triple {92950#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {92940#(or (not (= main_~c~0 0)) (<= main_~b~0 main_~c~0) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,747 INFO L290 TraceCheckUtils]: 75: Hoare triple {92950#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {92950#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,748 INFO L284 TraceCheckUtils]: 74: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {92950#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,748 INFO L290 TraceCheckUtils]: 73: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,749 INFO L290 TraceCheckUtils]: 71: Hoare triple {92630#true} ~cond := #in~cond; {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:06:47,749 INFO L272 TraceCheckUtils]: 70: Hoare triple {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,749 INFO L284 TraceCheckUtils]: 69: Hoare quadruple {92630#true} {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,749 INFO L290 TraceCheckUtils]: 68: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,750 INFO L290 TraceCheckUtils]: 67: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,750 INFO L290 TraceCheckUtils]: 66: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,750 INFO L272 TraceCheckUtils]: 65: Hoare triple {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,751 INFO L284 TraceCheckUtils]: 64: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {92989#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {92957#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,751 INFO L290 TraceCheckUtils]: 63: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,751 INFO L290 TraceCheckUtils]: 62: Hoare triple {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,752 INFO L290 TraceCheckUtils]: 61: Hoare triple {92630#true} ~cond := #in~cond; {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:06:47,752 INFO L272 TraceCheckUtils]: 60: Hoare triple {92989#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,753 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {92989#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,753 INFO L290 TraceCheckUtils]: 58: Hoare triple {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,753 INFO L290 TraceCheckUtils]: 57: Hoare triple {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {92814#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:06:47,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {92630#true} ~cond := #in~cond; {92967#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:06:47,754 INFO L272 TraceCheckUtils]: 55: Hoare triple {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,754 INFO L290 TraceCheckUtils]: 54: Hoare triple {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,755 INFO L290 TraceCheckUtils]: 53: Hoare triple {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {93005#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= main_~v~0 (* main_~d~0 main_~b~0))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:06:47,805 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {92630#true} {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #104#return; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,806 INFO L290 TraceCheckUtils]: 49: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,806 INFO L290 TraceCheckUtils]: 48: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,806 INFO L272 TraceCheckUtils]: 47: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,806 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {92630#true} {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #102#return; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,806 INFO L290 TraceCheckUtils]: 45: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,807 INFO L290 TraceCheckUtils]: 44: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,807 INFO L290 TraceCheckUtils]: 43: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,807 INFO L272 TraceCheckUtils]: 42: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,807 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {92630#true} {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #100#return; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,808 INFO L272 TraceCheckUtils]: 37: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,808 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {92630#true} {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #98#return; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,809 INFO L290 TraceCheckUtils]: 35: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,809 INFO L272 TraceCheckUtils]: 32: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,809 INFO L290 TraceCheckUtils]: 31: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} assume !!(#t~post8 < 100);havoc #t~post8; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {93027#(or (not (= (* main_~v~0 2) main_~c~0)) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* (* main_~d~0 main_~y~0 main_~s~0) 2) (* main_~q~0 main_~k~0 main_~x~0) (* main_~y~0 main_~s~0) (* 2 (* main_~d~0 main_~q~0 main_~x~0)))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (<= main_~b~0 0) (not (= (* 2 (* main_~d~0 main_~b~0)) (* main_~v~0 2))))} is VALID [2022-04-14 16:06:47,811 INFO L290 TraceCheckUtils]: 28: Hoare triple {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-14 16:06:47,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {92630#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {93097#(or (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ (* main_~y~0 main_~r~0) main_~b~0 (* main_~p~0 main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~k~0 main_~y~0 main_~s~0) (* main_~q~0 main_~k~0 main_~x~0) (* 2 (* main_~y~0 main_~s~0 1)) (* 2 (* main_~q~0 main_~x~0 1)) (* main_~y~0 main_~s~0))) (not (= main_~c~0 (* main_~b~0 2))) (<= main_~b~0 0))} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {92630#true} assume !!(#t~post6 < 100);havoc #t~post6; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {92630#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {92630#true} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 22: Hoare triple {92630#true} assume !(~c~0 >= ~b~0); {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {92630#true} assume !!(#t~post7 < 100);havoc #t~post7; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {92630#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 19: Hoare triple {92630#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {92630#true} is VALID [2022-04-14 16:06:47,813 INFO L290 TraceCheckUtils]: 18: Hoare triple {92630#true} assume !!(#t~post6 < 100);havoc #t~post6; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {92630#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {92630#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {92630#true} {92630#true} #96#return; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L272 TraceCheckUtils]: 11: Hoare triple {92630#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {92630#true} {92630#true} #94#return; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {92630#true} assume !(0 == ~cond); {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {92630#true} ~cond := #in~cond; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {92630#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 5: Hoare triple {92630#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L272 TraceCheckUtils]: 4: Hoare triple {92630#true} call #t~ret9 := main(); {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92630#true} {92630#true} #108#return; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {92630#true} assume true; {92630#true} is VALID [2022-04-14 16:06:47,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {92630#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {92630#true} is VALID [2022-04-14 16:06:47,815 INFO L272 TraceCheckUtils]: 0: Hoare triple {92630#true} call ULTIMATE.init(); {92630#true} is VALID [2022-04-14 16:06:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 65 proven. 19 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-14 16:06:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:06:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846929511] [2022-04-14 16:06:47,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:06:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581275014] [2022-04-14 16:06:47,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581275014] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:06:47,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:06:47,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 30 [2022-04-14 16:06:47,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451525917] [2022-04-14 16:06:47,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:06:47,816 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-14 16:06:47,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:06:47,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 16:06:48,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:06:48,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-14 16:06:48,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:06:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-14 16:06:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2022-04-14 16:06:48,299 INFO L87 Difference]: Start difference. First operand 2736 states and 3745 transitions. Second operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 16:07:12,167 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 16:07:19,394 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 16:07:39,733 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 16:07:49,433 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 16:08:07,935 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:08:09,946 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:08:16,253 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 16:08:22,201 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:08:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:08:47,992 INFO L93 Difference]: Finished difference Result 3529 states and 4842 transitions. [2022-04-14 16:08:47,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2022-04-14 16:08:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) Word has length 88 [2022-04-14 16:08:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:08:47,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 16:08:48,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 428 transitions. [2022-04-14 16:08:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 16:08:48,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 428 transitions. [2022-04-14 16:08:48,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 428 transitions. [2022-04-14 16:09:01,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 428 edges. 426 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-14 16:09:02,303 INFO L225 Difference]: With dead ends: 3529 [2022-04-14 16:09:02,304 INFO L226 Difference]: Without dead ends: 3498 [2022-04-14 16:09:02,306 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 167 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3596 ImplicationChecksByTransitivity, 45.1s TimeCoverageRelationStatistics Valid=1770, Invalid=9150, Unknown=0, NotChecked=0, Total=10920 [2022-04-14 16:09:02,307 INFO L913 BasicCegarLoop]: 88 mSDtfsCounter, 364 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 460 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2022-04-14 16:09:02,307 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [364 Valid, 1050 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 2079 Invalid, 6 Unknown, 0 Unchecked, 35.9s Time] [2022-04-14 16:09:02,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2022-04-14 16:09:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3192. [2022-04-14 16:09:08,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:09:08,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3498 states. Second operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:09:08,729 INFO L74 IsIncluded]: Start isIncluded. First operand 3498 states. Second operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:09:08,731 INFO L87 Difference]: Start difference. First operand 3498 states. Second operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:09:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:09:09,119 INFO L93 Difference]: Finished difference Result 3498 states and 4789 transitions. [2022-04-14 16:09:09,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4789 transitions. [2022-04-14 16:09:09,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:09:09,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:09:09,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) Second operand 3498 states. [2022-04-14 16:09:09,128 INFO L87 Difference]: Start difference. First operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) Second operand 3498 states. [2022-04-14 16:09:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:09:09,504 INFO L93 Difference]: Finished difference Result 3498 states and 4789 transitions. [2022-04-14 16:09:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 3498 states and 4789 transitions. [2022-04-14 16:09:09,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:09:09,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:09:09,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:09:09,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:09:09,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3192 states, 2279 states have (on average 1.3027643703378675) internal successors, (2969), 2328 states have internal predecessors, (2969), 737 states have call successors, (737), 177 states have call predecessors, (737), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:09:09,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3192 states to 3192 states and 4436 transitions. [2022-04-14 16:09:09,956 INFO L78 Accepts]: Start accepts. Automaton has 3192 states and 4436 transitions. Word has length 88 [2022-04-14 16:09:09,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:09:09,956 INFO L478 AbstractCegarLoop]: Abstraction has 3192 states and 4436 transitions. [2022-04-14 16:09:09,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 11 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 8 states have call predecessors, (19), 9 states have call successors, (19) [2022-04-14 16:09:09,957 INFO L276 IsEmpty]: Start isEmpty. Operand 3192 states and 4436 transitions. [2022-04-14 16:09:09,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-14 16:09:09,957 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:09:09,958 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:09:09,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-14 16:09:10,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-14 16:09:10,174 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:09:10,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:09:10,174 INFO L85 PathProgramCache]: Analyzing trace with hash 516983514, now seen corresponding path program 3 times [2022-04-14 16:09:10,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:09:10,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539300912] [2022-04-14 16:09:10,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:09:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:09:10,189 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:09:10,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1893129074] [2022-04-14 16:09:10,189 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:09:10,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:09:10,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:09:10,197 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:09:10,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-14 16:09:10,263 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 16:09:10,264 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:09:10,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-14 16:09:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:09:10,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:09:11,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {110004#true} call ULTIMATE.init(); {110004#true} is VALID [2022-04-14 16:09:11,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {110004#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110004#true} {110004#true} #108#return; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {110004#true} call #t~ret9 := main(); {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {110004#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L272 TraceCheckUtils]: 6: Hoare triple {110004#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110004#true} {110004#true} #94#return; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {110004#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,032 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110004#true} {110004#true} #96#return; {110004#true} is VALID [2022-04-14 16:09:11,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {110004#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {110057#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,035 INFO L290 TraceCheckUtils]: 22: Hoare triple {110067#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,036 INFO L272 TraceCheckUtils]: 25: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,036 INFO L290 TraceCheckUtils]: 27: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,036 INFO L290 TraceCheckUtils]: 28: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,037 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {110004#true} {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #98#return; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,037 INFO L272 TraceCheckUtils]: 30: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,037 INFO L290 TraceCheckUtils]: 31: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,037 INFO L290 TraceCheckUtils]: 33: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,038 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {110004#true} {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,038 INFO L272 TraceCheckUtils]: 35: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,038 INFO L290 TraceCheckUtils]: 36: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,038 INFO L290 TraceCheckUtils]: 37: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,038 INFO L290 TraceCheckUtils]: 38: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,039 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110004#true} {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,039 INFO L272 TraceCheckUtils]: 40: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,039 INFO L290 TraceCheckUtils]: 41: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,039 INFO L290 TraceCheckUtils]: 42: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,039 INFO L290 TraceCheckUtils]: 43: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,040 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {110004#true} {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {110077#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~y~0 main_~v~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,041 INFO L290 TraceCheckUtils]: 48: Hoare triple {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,042 INFO L290 TraceCheckUtils]: 49: Hoare triple {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,042 INFO L290 TraceCheckUtils]: 50: Hoare triple {110150#(and (= main_~r~0 0) (= main_~y~0 (+ (* (- 1) main_~c~0) main_~x~0)) (= main_~s~0 1) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,042 INFO L290 TraceCheckUtils]: 51: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,043 INFO L290 TraceCheckUtils]: 52: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,043 INFO L290 TraceCheckUtils]: 53: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,044 INFO L290 TraceCheckUtils]: 54: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,044 INFO L290 TraceCheckUtils]: 55: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post7 < 100);havoc #t~post7; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,044 INFO L290 TraceCheckUtils]: 56: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,045 INFO L290 TraceCheckUtils]: 57: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,045 INFO L290 TraceCheckUtils]: 58: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post8 < 100);havoc #t~post8; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,045 INFO L272 TraceCheckUtils]: 59: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,046 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110004#true} {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #98#return; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,046 INFO L272 TraceCheckUtils]: 64: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,046 INFO L290 TraceCheckUtils]: 65: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,046 INFO L290 TraceCheckUtils]: 66: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,046 INFO L290 TraceCheckUtils]: 67: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,047 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {110004#true} {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #100#return; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,047 INFO L272 TraceCheckUtils]: 69: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,047 INFO L290 TraceCheckUtils]: 70: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,047 INFO L290 TraceCheckUtils]: 71: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,047 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {110004#true} {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #102#return; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,047 INFO L272 TraceCheckUtils]: 74: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,048 INFO L290 TraceCheckUtils]: 75: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,048 INFO L290 TraceCheckUtils]: 76: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,048 INFO L290 TraceCheckUtils]: 77: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,048 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {110004#true} {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #104#return; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,049 INFO L290 TraceCheckUtils]: 79: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(~c~0 >= 2 * ~v~0); {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,049 INFO L290 TraceCheckUtils]: 80: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,049 INFO L290 TraceCheckUtils]: 81: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,050 INFO L290 TraceCheckUtils]: 82: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !!(#t~post7 < 100);havoc #t~post7; {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,050 INFO L290 TraceCheckUtils]: 83: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} assume !(~c~0 >= ~b~0); {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} is VALID [2022-04-14 16:09:11,050 INFO L290 TraceCheckUtils]: 84: Hoare triple {110163#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~q~0 1) (= (+ main_~s~0 1) 0))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,051 INFO L290 TraceCheckUtils]: 85: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,051 INFO L290 TraceCheckUtils]: 86: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,052 INFO L290 TraceCheckUtils]: 87: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,052 INFO L290 TraceCheckUtils]: 88: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,052 INFO L290 TraceCheckUtils]: 89: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,053 INFO L290 TraceCheckUtils]: 90: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,053 INFO L290 TraceCheckUtils]: 91: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,053 INFO L290 TraceCheckUtils]: 92: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:09:11,054 INFO L272 TraceCheckUtils]: 93: Hoare triple {110266#(and (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~a~0) (= (+ main_~r~0 1) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:09:11,054 INFO L290 TraceCheckUtils]: 94: Hoare triple {110294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:09:11,055 INFO L290 TraceCheckUtils]: 95: Hoare triple {110298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110005#false} is VALID [2022-04-14 16:09:11,055 INFO L290 TraceCheckUtils]: 96: Hoare triple {110005#false} assume !false; {110005#false} is VALID [2022-04-14 16:09:11,055 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-14 16:09:11,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:09:11,501 INFO L290 TraceCheckUtils]: 96: Hoare triple {110005#false} assume !false; {110005#false} is VALID [2022-04-14 16:09:11,502 INFO L290 TraceCheckUtils]: 95: Hoare triple {110298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {110005#false} is VALID [2022-04-14 16:09:11,502 INFO L290 TraceCheckUtils]: 94: Hoare triple {110294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {110298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:09:11,503 INFO L272 TraceCheckUtils]: 93: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:09:11,503 INFO L290 TraceCheckUtils]: 92: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,503 INFO L290 TraceCheckUtils]: 91: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,504 INFO L290 TraceCheckUtils]: 90: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,504 INFO L290 TraceCheckUtils]: 88: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,505 INFO L290 TraceCheckUtils]: 87: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,505 INFO L290 TraceCheckUtils]: 86: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,505 INFO L290 TraceCheckUtils]: 85: Hoare triple {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,506 INFO L290 TraceCheckUtils]: 84: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {110314#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:09:11,506 INFO L290 TraceCheckUtils]: 83: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= ~b~0); {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,506 INFO L290 TraceCheckUtils]: 82: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,507 INFO L290 TraceCheckUtils]: 80: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,507 INFO L290 TraceCheckUtils]: 79: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !(~c~0 >= 2 * ~v~0); {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,508 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {110004#true} {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #104#return; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,508 INFO L290 TraceCheckUtils]: 77: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,508 INFO L290 TraceCheckUtils]: 76: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,508 INFO L290 TraceCheckUtils]: 75: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,508 INFO L272 TraceCheckUtils]: 74: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,509 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {110004#true} {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #102#return; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,509 INFO L290 TraceCheckUtils]: 72: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,509 INFO L290 TraceCheckUtils]: 71: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,509 INFO L290 TraceCheckUtils]: 70: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,509 INFO L272 TraceCheckUtils]: 69: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,510 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {110004#true} {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #100#return; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,510 INFO L290 TraceCheckUtils]: 67: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,510 INFO L290 TraceCheckUtils]: 66: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,510 INFO L290 TraceCheckUtils]: 65: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,510 INFO L272 TraceCheckUtils]: 64: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,510 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {110004#true} {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #98#return; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,511 INFO L290 TraceCheckUtils]: 62: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:11,511 INFO L290 TraceCheckUtils]: 61: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:11,511 INFO L290 TraceCheckUtils]: 60: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:11,511 INFO L272 TraceCheckUtils]: 59: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:11,511 INFO L290 TraceCheckUtils]: 58: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,511 INFO L290 TraceCheckUtils]: 57: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,512 INFO L290 TraceCheckUtils]: 56: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,512 INFO L290 TraceCheckUtils]: 55: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,512 INFO L290 TraceCheckUtils]: 54: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:11,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 16:09:13,515 WARN L290 TraceCheckUtils]: 50: Hoare triple {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {110342#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-14 16:09:13,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !(~c~0 >= ~b~0); {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:09:13,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} assume !!(#t~post7 < 100);havoc #t~post7; {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:09:13,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-14 16:09:15,518 WARN L290 TraceCheckUtils]: 46: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {110445#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is UNKNOWN [2022-04-14 16:09:15,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} assume !(~c~0 >= 2 * ~v~0); {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,519 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {110004#true} {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #104#return; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,519 INFO L290 TraceCheckUtils]: 43: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,519 INFO L290 TraceCheckUtils]: 42: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,519 INFO L290 TraceCheckUtils]: 41: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,519 INFO L272 TraceCheckUtils]: 40: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,520 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {110004#true} {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #102#return; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,520 INFO L290 TraceCheckUtils]: 38: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,520 INFO L290 TraceCheckUtils]: 37: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,520 INFO L290 TraceCheckUtils]: 36: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,520 INFO L272 TraceCheckUtils]: 35: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,521 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {110004#true} {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #100#return; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,521 INFO L290 TraceCheckUtils]: 33: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,521 INFO L290 TraceCheckUtils]: 32: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,521 INFO L272 TraceCheckUtils]: 30: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,523 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {110004#true} {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #98#return; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,523 INFO L290 TraceCheckUtils]: 27: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,523 INFO L290 TraceCheckUtils]: 26: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,523 INFO L272 TraceCheckUtils]: 25: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {110458#(= (+ main_~c~0 (* (- 1) main_~v~0)) (+ (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)))} is VALID [2022-04-14 16:09:15,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} is VALID [2022-04-14 16:09:15,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} is VALID [2022-04-14 16:09:15,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {110531#(= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ main_~c~0 (* (- 1) main_~b~0)))} is VALID [2022-04-14 16:09:15,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} assume !!(#t~post6 < 100);havoc #t~post6; {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 16:09:15,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 16:09:15,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {110004#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {110541#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 16:09:15,527 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {110004#true} {110004#true} #96#return; {110004#true} is VALID [2022-04-14 16:09:15,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,527 INFO L272 TraceCheckUtils]: 11: Hoare triple {110004#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,527 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110004#true} {110004#true} #94#return; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {110004#true} assume !(0 == ~cond); {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {110004#true} ~cond := #in~cond; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {110004#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {110004#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {110004#true} call #t~ret9 := main(); {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110004#true} {110004#true} #108#return; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {110004#true} assume true; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {110004#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {110004#true} call ULTIMATE.init(); {110004#true} is VALID [2022-04-14 16:09:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 16 proven. 51 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2022-04-14 16:09:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:09:15,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539300912] [2022-04-14 16:09:15,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:09:15,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893129074] [2022-04-14 16:09:15,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893129074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:09:15,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:09:15,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-14 16:09:15,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11795560] [2022-04-14 16:09:15,529 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:09:15,529 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-04-14 16:09:15,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:09:15,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-14 16:09:16,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:09:16,296 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-14 16:09:16,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:09:16,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-14 16:09:16,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2022-04-14 16:09:16,296 INFO L87 Difference]: Start difference. First operand 3192 states and 4436 transitions. Second operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-14 16:09:23,370 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 16:09:31,839 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 16:09:49,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:09:49,738 INFO L93 Difference]: Finished difference Result 3403 states and 4731 transitions. [2022-04-14 16:09:49,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-14 16:09:49,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) Word has length 97 [2022-04-14 16:09:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:09:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-14 16:09:49,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 167 transitions. [2022-04-14 16:09:49,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-14 16:09:49,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 167 transitions. [2022-04-14 16:09:49,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 167 transitions. [2022-04-14 16:09:56,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 166 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 16:09:56,637 INFO L225 Difference]: With dead ends: 3403 [2022-04-14 16:09:56,637 INFO L226 Difference]: Without dead ends: 3391 [2022-04-14 16:09:56,638 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 178 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=729, Unknown=0, NotChecked=0, Total=930 [2022-04-14 16:09:56,638 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 116 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 140 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:09:56,638 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 469 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 618 Invalid, 1 Unknown, 0 Unchecked, 13.6s Time] [2022-04-14 16:09:56,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3391 states. [2022-04-14 16:10:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3391 to 3119. [2022-04-14 16:10:02,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:10:02,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3391 states. Second operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:10:02,718 INFO L74 IsIncluded]: Start isIncluded. First operand 3391 states. Second operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:10:02,720 INFO L87 Difference]: Start difference. First operand 3391 states. Second operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:10:03,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:10:03,065 INFO L93 Difference]: Finished difference Result 3391 states and 4715 transitions. [2022-04-14 16:10:03,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4715 transitions. [2022-04-14 16:10:03,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:10:03,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:10:03,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) Second operand 3391 states. [2022-04-14 16:10:03,074 INFO L87 Difference]: Start difference. First operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) Second operand 3391 states. [2022-04-14 16:10:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:10:03,415 INFO L93 Difference]: Finished difference Result 3391 states and 4715 transitions. [2022-04-14 16:10:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3391 states and 4715 transitions. [2022-04-14 16:10:03,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:10:03,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:10:03,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:10:03,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:10:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3119 states, 2211 states have (on average 1.3021257349615558) internal successors, (2879), 2255 states have internal predecessors, (2879), 732 states have call successors, (732), 177 states have call predecessors, (732), 175 states have return successors, (730), 686 states have call predecessors, (730), 730 states have call successors, (730) [2022-04-14 16:10:03,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3119 states to 3119 states and 4341 transitions. [2022-04-14 16:10:03,840 INFO L78 Accepts]: Start accepts. Automaton has 3119 states and 4341 transitions. Word has length 97 [2022-04-14 16:10:03,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:10:03,841 INFO L478 AbstractCegarLoop]: Abstraction has 3119 states and 4341 transitions. [2022-04-14 16:10:03,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.125) internal successors, (82), 15 states have internal predecessors, (82), 7 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 5 states have call predecessors, (19), 5 states have call successors, (19) [2022-04-14 16:10:03,841 INFO L276 IsEmpty]: Start isEmpty. Operand 3119 states and 4341 transitions. [2022-04-14 16:10:03,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-14 16:10:03,841 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:10:03,841 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:10:03,857 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-14 16:10:04,047 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:10:04,047 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:10:04,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:10:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 493698625, now seen corresponding path program 1 times [2022-04-14 16:10:04,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:10:04,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615579105] [2022-04-14 16:10:04,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:10:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:10:04,075 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:10:04,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [206965602] [2022-04-14 16:10:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:10:04,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:10:04,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:10:04,080 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:10:04,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-14 16:10:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:10:04,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 16:10:04,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:10:04,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:10:04,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {126875#true} call ULTIMATE.init(); {126875#true} is VALID [2022-04-14 16:10:04,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {126875#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {126883#(<= ~counter~0 0)} assume true; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {126883#(<= ~counter~0 0)} {126875#true} #108#return; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {126883#(<= ~counter~0 0)} call #t~ret9 := main(); {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {126883#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {126883#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {126883#(<= ~counter~0 0)} ~cond := #in~cond; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {126883#(<= ~counter~0 0)} assume !(0 == ~cond); {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {126883#(<= ~counter~0 0)} assume true; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,632 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126883#(<= ~counter~0 0)} {126883#(<= ~counter~0 0)} #94#return; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,632 INFO L272 TraceCheckUtils]: 11: Hoare triple {126883#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {126883#(<= ~counter~0 0)} ~cond := #in~cond; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {126883#(<= ~counter~0 0)} assume !(0 == ~cond); {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {126883#(<= ~counter~0 0)} assume true; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,633 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126883#(<= ~counter~0 0)} {126883#(<= ~counter~0 0)} #96#return; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {126883#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {126883#(<= ~counter~0 0)} is VALID [2022-04-14 16:10:04,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {126883#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126932#(<= ~counter~0 1)} is VALID [2022-04-14 16:10:04,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {126932#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {126932#(<= ~counter~0 1)} is VALID [2022-04-14 16:10:04,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {126932#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {126932#(<= ~counter~0 1)} is VALID [2022-04-14 16:10:04,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {126932#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {126942#(<= ~counter~0 2)} is VALID [2022-04-14 16:10:04,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {126942#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {126942#(<= ~counter~0 2)} is VALID [2022-04-14 16:10:04,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {126942#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {126942#(<= ~counter~0 2)} is VALID [2022-04-14 16:10:04,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {126942#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {126952#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,638 INFO L272 TraceCheckUtils]: 25: Hoare triple {126952#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {126952#(<= ~counter~0 3)} ~cond := #in~cond; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,639 INFO L290 TraceCheckUtils]: 27: Hoare triple {126952#(<= ~counter~0 3)} assume !(0 == ~cond); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,639 INFO L290 TraceCheckUtils]: 28: Hoare triple {126952#(<= ~counter~0 3)} assume true; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,640 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {126952#(<= ~counter~0 3)} {126952#(<= ~counter~0 3)} #98#return; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,640 INFO L272 TraceCheckUtils]: 30: Hoare triple {126952#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,640 INFO L290 TraceCheckUtils]: 31: Hoare triple {126952#(<= ~counter~0 3)} ~cond := #in~cond; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {126952#(<= ~counter~0 3)} assume !(0 == ~cond); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {126952#(<= ~counter~0 3)} assume true; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,641 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {126952#(<= ~counter~0 3)} {126952#(<= ~counter~0 3)} #100#return; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,642 INFO L272 TraceCheckUtils]: 35: Hoare triple {126952#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {126952#(<= ~counter~0 3)} ~cond := #in~cond; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {126952#(<= ~counter~0 3)} assume !(0 == ~cond); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {126952#(<= ~counter~0 3)} assume true; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,643 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126952#(<= ~counter~0 3)} {126952#(<= ~counter~0 3)} #102#return; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,644 INFO L272 TraceCheckUtils]: 40: Hoare triple {126952#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,644 INFO L290 TraceCheckUtils]: 41: Hoare triple {126952#(<= ~counter~0 3)} ~cond := #in~cond; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,644 INFO L290 TraceCheckUtils]: 42: Hoare triple {126952#(<= ~counter~0 3)} assume !(0 == ~cond); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,644 INFO L290 TraceCheckUtils]: 43: Hoare triple {126952#(<= ~counter~0 3)} assume true; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,645 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {126952#(<= ~counter~0 3)} {126952#(<= ~counter~0 3)} #104#return; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,645 INFO L290 TraceCheckUtils]: 45: Hoare triple {126952#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,645 INFO L290 TraceCheckUtils]: 46: Hoare triple {126952#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {126952#(<= ~counter~0 3)} is VALID [2022-04-14 16:10:04,646 INFO L290 TraceCheckUtils]: 47: Hoare triple {126952#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127025#(<= ~counter~0 4)} is VALID [2022-04-14 16:10:04,647 INFO L290 TraceCheckUtils]: 48: Hoare triple {127025#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {127025#(<= ~counter~0 4)} is VALID [2022-04-14 16:10:04,647 INFO L290 TraceCheckUtils]: 49: Hoare triple {127025#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {127025#(<= ~counter~0 4)} is VALID [2022-04-14 16:10:04,647 INFO L290 TraceCheckUtils]: 50: Hoare triple {127025#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {127025#(<= ~counter~0 4)} is VALID [2022-04-14 16:10:04,648 INFO L290 TraceCheckUtils]: 51: Hoare triple {127025#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127038#(<= ~counter~0 5)} is VALID [2022-04-14 16:10:04,648 INFO L290 TraceCheckUtils]: 52: Hoare triple {127038#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {127038#(<= ~counter~0 5)} is VALID [2022-04-14 16:10:04,648 INFO L290 TraceCheckUtils]: 53: Hoare triple {127038#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {127038#(<= ~counter~0 5)} is VALID [2022-04-14 16:10:04,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {127038#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127048#(<= ~counter~0 6)} is VALID [2022-04-14 16:10:04,649 INFO L290 TraceCheckUtils]: 55: Hoare triple {127048#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {127048#(<= ~counter~0 6)} is VALID [2022-04-14 16:10:04,650 INFO L290 TraceCheckUtils]: 56: Hoare triple {127048#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {127048#(<= ~counter~0 6)} is VALID [2022-04-14 16:10:04,650 INFO L290 TraceCheckUtils]: 57: Hoare triple {127048#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,651 INFO L290 TraceCheckUtils]: 58: Hoare triple {127058#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,651 INFO L272 TraceCheckUtils]: 59: Hoare triple {127058#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,651 INFO L290 TraceCheckUtils]: 60: Hoare triple {127058#(<= ~counter~0 7)} ~cond := #in~cond; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,652 INFO L290 TraceCheckUtils]: 61: Hoare triple {127058#(<= ~counter~0 7)} assume !(0 == ~cond); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,652 INFO L290 TraceCheckUtils]: 62: Hoare triple {127058#(<= ~counter~0 7)} assume true; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,652 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127058#(<= ~counter~0 7)} {127058#(<= ~counter~0 7)} #98#return; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,653 INFO L272 TraceCheckUtils]: 64: Hoare triple {127058#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,653 INFO L290 TraceCheckUtils]: 65: Hoare triple {127058#(<= ~counter~0 7)} ~cond := #in~cond; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,654 INFO L290 TraceCheckUtils]: 66: Hoare triple {127058#(<= ~counter~0 7)} assume !(0 == ~cond); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,654 INFO L290 TraceCheckUtils]: 67: Hoare triple {127058#(<= ~counter~0 7)} assume true; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,654 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {127058#(<= ~counter~0 7)} {127058#(<= ~counter~0 7)} #100#return; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,655 INFO L272 TraceCheckUtils]: 69: Hoare triple {127058#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,655 INFO L290 TraceCheckUtils]: 70: Hoare triple {127058#(<= ~counter~0 7)} ~cond := #in~cond; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,655 INFO L290 TraceCheckUtils]: 71: Hoare triple {127058#(<= ~counter~0 7)} assume !(0 == ~cond); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,656 INFO L290 TraceCheckUtils]: 72: Hoare triple {127058#(<= ~counter~0 7)} assume true; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,656 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {127058#(<= ~counter~0 7)} {127058#(<= ~counter~0 7)} #102#return; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,656 INFO L272 TraceCheckUtils]: 74: Hoare triple {127058#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,657 INFO L290 TraceCheckUtils]: 75: Hoare triple {127058#(<= ~counter~0 7)} ~cond := #in~cond; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,657 INFO L290 TraceCheckUtils]: 76: Hoare triple {127058#(<= ~counter~0 7)} assume !(0 == ~cond); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,657 INFO L290 TraceCheckUtils]: 77: Hoare triple {127058#(<= ~counter~0 7)} assume true; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,658 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {127058#(<= ~counter~0 7)} {127058#(<= ~counter~0 7)} #104#return; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {127058#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {127058#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {127058#(<= ~counter~0 7)} is VALID [2022-04-14 16:10:04,659 INFO L290 TraceCheckUtils]: 81: Hoare triple {127058#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127131#(<= ~counter~0 8)} is VALID [2022-04-14 16:10:04,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {127131#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {127131#(<= ~counter~0 8)} is VALID [2022-04-14 16:10:04,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {127131#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {127131#(<= ~counter~0 8)} is VALID [2022-04-14 16:10:04,660 INFO L290 TraceCheckUtils]: 84: Hoare triple {127131#(<= ~counter~0 8)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {127131#(<= ~counter~0 8)} is VALID [2022-04-14 16:10:04,660 INFO L290 TraceCheckUtils]: 85: Hoare triple {127131#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127144#(<= ~counter~0 9)} is VALID [2022-04-14 16:10:04,661 INFO L290 TraceCheckUtils]: 86: Hoare triple {127144#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {127144#(<= ~counter~0 9)} is VALID [2022-04-14 16:10:04,661 INFO L290 TraceCheckUtils]: 87: Hoare triple {127144#(<= ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {127144#(<= ~counter~0 9)} is VALID [2022-04-14 16:10:04,661 INFO L290 TraceCheckUtils]: 88: Hoare triple {127144#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127154#(<= |main_#t~post7| 9)} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {127154#(<= |main_#t~post7| 9)} assume !(#t~post7 < 100);havoc #t~post7; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {126876#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 91: Hoare triple {126876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {126876#false} assume !!(#t~post6 < 100);havoc #t~post6; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {126876#false} assume !(0 != ~b~0); {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L272 TraceCheckUtils]: 94: Hoare triple {126876#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 95: Hoare triple {126876#false} ~cond := #in~cond; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {126876#false} assume 0 == ~cond; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {126876#false} assume !false; {126876#false} is VALID [2022-04-14 16:10:04,662 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 108 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 16:10:04,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:10:05,177 INFO L290 TraceCheckUtils]: 97: Hoare triple {126876#false} assume !false; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {126876#false} assume 0 == ~cond; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {126876#false} ~cond := #in~cond; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L272 TraceCheckUtils]: 94: Hoare triple {126876#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 93: Hoare triple {126876#false} assume !(0 != ~b~0); {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 92: Hoare triple {126876#false} assume !!(#t~post6 < 100);havoc #t~post6; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 91: Hoare triple {126876#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 90: Hoare triple {126876#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {126876#false} is VALID [2022-04-14 16:10:05,178 INFO L290 TraceCheckUtils]: 89: Hoare triple {127206#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {126876#false} is VALID [2022-04-14 16:10:05,179 INFO L290 TraceCheckUtils]: 88: Hoare triple {127210#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127206#(< |main_#t~post7| 100)} is VALID [2022-04-14 16:10:05,179 INFO L290 TraceCheckUtils]: 87: Hoare triple {127210#(< ~counter~0 100)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {127210#(< ~counter~0 100)} is VALID [2022-04-14 16:10:05,179 INFO L290 TraceCheckUtils]: 86: Hoare triple {127210#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {127210#(< ~counter~0 100)} is VALID [2022-04-14 16:10:05,180 INFO L290 TraceCheckUtils]: 85: Hoare triple {127220#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127210#(< ~counter~0 100)} is VALID [2022-04-14 16:10:05,181 INFO L290 TraceCheckUtils]: 84: Hoare triple {127220#(< ~counter~0 99)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {127220#(< ~counter~0 99)} is VALID [2022-04-14 16:10:05,181 INFO L290 TraceCheckUtils]: 83: Hoare triple {127220#(< ~counter~0 99)} assume !(~c~0 >= ~b~0); {127220#(< ~counter~0 99)} is VALID [2022-04-14 16:10:05,181 INFO L290 TraceCheckUtils]: 82: Hoare triple {127220#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {127220#(< ~counter~0 99)} is VALID [2022-04-14 16:10:05,182 INFO L290 TraceCheckUtils]: 81: Hoare triple {127233#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127220#(< ~counter~0 99)} is VALID [2022-04-14 16:10:05,182 INFO L290 TraceCheckUtils]: 80: Hoare triple {127233#(< ~counter~0 98)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,182 INFO L290 TraceCheckUtils]: 79: Hoare triple {127233#(< ~counter~0 98)} assume !(~c~0 >= 2 * ~v~0); {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,183 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {126875#true} {127233#(< ~counter~0 98)} #104#return; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,183 INFO L290 TraceCheckUtils]: 77: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,183 INFO L290 TraceCheckUtils]: 76: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,183 INFO L272 TraceCheckUtils]: 74: Hoare triple {127233#(< ~counter~0 98)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,184 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {126875#true} {127233#(< ~counter~0 98)} #102#return; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,184 INFO L290 TraceCheckUtils]: 72: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,184 INFO L290 TraceCheckUtils]: 71: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,184 INFO L290 TraceCheckUtils]: 70: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,184 INFO L272 TraceCheckUtils]: 69: Hoare triple {127233#(< ~counter~0 98)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,184 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {126875#true} {127233#(< ~counter~0 98)} #100#return; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,184 INFO L290 TraceCheckUtils]: 67: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L290 TraceCheckUtils]: 66: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L290 TraceCheckUtils]: 65: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L272 TraceCheckUtils]: 64: Hoare triple {127233#(< ~counter~0 98)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {126875#true} {127233#(< ~counter~0 98)} #98#return; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,185 INFO L290 TraceCheckUtils]: 62: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L290 TraceCheckUtils]: 61: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L290 TraceCheckUtils]: 60: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,185 INFO L272 TraceCheckUtils]: 59: Hoare triple {127233#(< ~counter~0 98)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {127233#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,186 INFO L290 TraceCheckUtils]: 57: Hoare triple {127306#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127233#(< ~counter~0 98)} is VALID [2022-04-14 16:10:05,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {127306#(< ~counter~0 97)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {127306#(< ~counter~0 97)} is VALID [2022-04-14 16:10:05,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {127306#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {127306#(< ~counter~0 97)} is VALID [2022-04-14 16:10:05,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {127316#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127306#(< ~counter~0 97)} is VALID [2022-04-14 16:10:05,188 INFO L290 TraceCheckUtils]: 53: Hoare triple {127316#(< ~counter~0 96)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {127316#(< ~counter~0 96)} is VALID [2022-04-14 16:10:05,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {127316#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {127316#(< ~counter~0 96)} is VALID [2022-04-14 16:10:05,189 INFO L290 TraceCheckUtils]: 51: Hoare triple {127326#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127316#(< ~counter~0 96)} is VALID [2022-04-14 16:10:05,189 INFO L290 TraceCheckUtils]: 50: Hoare triple {127326#(< ~counter~0 95)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {127326#(< ~counter~0 95)} is VALID [2022-04-14 16:10:05,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {127326#(< ~counter~0 95)} assume !(~c~0 >= ~b~0); {127326#(< ~counter~0 95)} is VALID [2022-04-14 16:10:05,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {127326#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {127326#(< ~counter~0 95)} is VALID [2022-04-14 16:10:05,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {127339#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127326#(< ~counter~0 95)} is VALID [2022-04-14 16:10:05,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {127339#(< ~counter~0 94)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {127339#(< ~counter~0 94)} assume !(~c~0 >= 2 * ~v~0); {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,191 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {126875#true} {127339#(< ~counter~0 94)} #104#return; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,191 INFO L272 TraceCheckUtils]: 40: Hoare triple {127339#(< ~counter~0 94)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,192 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {126875#true} {127339#(< ~counter~0 94)} #102#return; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,192 INFO L290 TraceCheckUtils]: 37: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,192 INFO L290 TraceCheckUtils]: 36: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,192 INFO L272 TraceCheckUtils]: 35: Hoare triple {127339#(< ~counter~0 94)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,192 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {126875#true} {127339#(< ~counter~0 94)} #100#return; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L272 TraceCheckUtils]: 30: Hoare triple {127339#(< ~counter~0 94)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {126875#true} {127339#(< ~counter~0 94)} #98#return; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 27: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L290 TraceCheckUtils]: 26: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,193 INFO L272 TraceCheckUtils]: 25: Hoare triple {127339#(< ~counter~0 94)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {127339#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {127412#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127339#(< ~counter~0 94)} is VALID [2022-04-14 16:10:05,195 INFO L290 TraceCheckUtils]: 22: Hoare triple {127412#(< ~counter~0 93)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {127412#(< ~counter~0 93)} is VALID [2022-04-14 16:10:05,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {127412#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {127412#(< ~counter~0 93)} is VALID [2022-04-14 16:10:05,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {127422#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127412#(< ~counter~0 93)} is VALID [2022-04-14 16:10:05,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {127422#(< ~counter~0 92)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {127422#(< ~counter~0 92)} is VALID [2022-04-14 16:10:05,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {127422#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {127422#(< ~counter~0 92)} is VALID [2022-04-14 16:10:05,197 INFO L290 TraceCheckUtils]: 17: Hoare triple {127432#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127422#(< ~counter~0 92)} is VALID [2022-04-14 16:10:05,197 INFO L290 TraceCheckUtils]: 16: Hoare triple {127432#(< ~counter~0 91)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,197 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {126875#true} {127432#(< ~counter~0 91)} #96#return; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,197 INFO L290 TraceCheckUtils]: 14: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L272 TraceCheckUtils]: 11: Hoare triple {127432#(< ~counter~0 91)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {126875#true} {127432#(< ~counter~0 91)} #94#return; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {126875#true} assume true; {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {126875#true} assume !(0 == ~cond); {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {126875#true} ~cond := #in~cond; {126875#true} is VALID [2022-04-14 16:10:05,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {127432#(< ~counter~0 91)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {126875#true} is VALID [2022-04-14 16:10:05,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {127432#(< ~counter~0 91)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {127432#(< ~counter~0 91)} call #t~ret9 := main(); {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127432#(< ~counter~0 91)} {126875#true} #108#return; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {127432#(< ~counter~0 91)} assume true; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {126875#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {127432#(< ~counter~0 91)} is VALID [2022-04-14 16:10:05,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {126875#true} call ULTIMATE.init(); {126875#true} is VALID [2022-04-14 16:10:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 27 proven. 44 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-14 16:10:05,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:10:05,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615579105] [2022-04-14 16:10:05,200 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:10:05,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206965602] [2022-04-14 16:10:05,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206965602] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:10:05,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:10:05,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-14 16:10:05,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537315485] [2022-04-14 16:10:05,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:10:05,201 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-04-14 16:10:05,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:10:05,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:10:05,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:10:05,314 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-14 16:10:05,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:10:05,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-14 16:10:05,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-14 16:10:05,315 INFO L87 Difference]: Start difference. First operand 3119 states and 4341 transitions. Second operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:10:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:10:18,090 INFO L93 Difference]: Finished difference Result 7132 states and 10399 transitions. [2022-04-14 16:10:18,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-14 16:10:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 98 [2022-04-14 16:10:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:10:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:10:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 562 transitions. [2022-04-14 16:10:18,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:10:18,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 562 transitions. [2022-04-14 16:10:18,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 562 transitions. [2022-04-14 16:10:18,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 562 edges. 562 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:10:19,958 INFO L225 Difference]: With dead ends: 7132 [2022-04-14 16:10:19,958 INFO L226 Difference]: Without dead ends: 6000 [2022-04-14 16:10:19,961 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=585, Invalid=1055, Unknown=0, NotChecked=0, Total=1640 [2022-04-14 16:10:19,962 INFO L913 BasicCegarLoop]: 113 mSDtfsCounter, 631 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 351 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 351 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-14 16:10:19,962 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 681 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [351 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-14 16:10:19,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6000 states. [2022-04-14 16:10:31,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6000 to 5690. [2022-04-14 16:10:31,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:10:31,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6000 states. Second operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) [2022-04-14 16:10:31,327 INFO L74 IsIncluded]: Start isIncluded. First operand 6000 states. Second operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) [2022-04-14 16:10:31,330 INFO L87 Difference]: Start difference. First operand 6000 states. Second operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) [2022-04-14 16:10:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:10:32,320 INFO L93 Difference]: Finished difference Result 6000 states and 8433 transitions. [2022-04-14 16:10:32,320 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 8433 transitions. [2022-04-14 16:10:32,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:10:32,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:10:32,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) Second operand 6000 states. [2022-04-14 16:10:32,351 INFO L87 Difference]: Start difference. First operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) Second operand 6000 states. [2022-04-14 16:10:33,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:10:33,273 INFO L93 Difference]: Finished difference Result 6000 states and 8433 transitions. [2022-04-14 16:10:33,273 INFO L276 IsEmpty]: Start isEmpty. Operand 6000 states and 8433 transitions. [2022-04-14 16:10:33,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:10:33,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:10:33,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:10:33,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:10:33,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5690 states, 3782 states have (on average 1.297197250132205) internal successors, (4906), 3804 states have internal predecessors, (4906), 1601 states have call successors, (1601), 308 states have call predecessors, (1601), 306 states have return successors, (1599), 1577 states have call predecessors, (1599), 1599 states have call successors, (1599) [2022-04-14 16:10:34,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5690 states to 5690 states and 8106 transitions. [2022-04-14 16:10:34,650 INFO L78 Accepts]: Start accepts. Automaton has 5690 states and 8106 transitions. Word has length 98 [2022-04-14 16:10:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:10:34,650 INFO L478 AbstractCegarLoop]: Abstraction has 5690 states and 8106 transitions. [2022-04-14 16:10:34,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.0) internal successors, (96), 24 states have internal predecessors, (96), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:10:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 5690 states and 8106 transitions. [2022-04-14 16:10:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-14 16:10:34,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:10:34,652 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:10:34,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-14 16:10:34,867 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:10:34,867 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:10:34,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:10:34,868 INFO L85 PathProgramCache]: Analyzing trace with hash 911562927, now seen corresponding path program 2 times [2022-04-14 16:10:34,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:10:34,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985693025] [2022-04-14 16:10:34,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:10:34,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:10:34,885 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:10:34,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301550686] [2022-04-14 16:10:34,885 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:10:34,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:10:34,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:10:34,886 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:10:34,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-14 16:10:34,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:10:34,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:10:34,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 74 conjunts are in the unsatisfiable core [2022-04-14 16:10:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:10:34,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:10:36,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {158495#true} call ULTIMATE.init(); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {158495#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158495#true} {158495#true} #108#return; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {158495#true} call #t~ret9 := main(); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {158495#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L272 TraceCheckUtils]: 6: Hoare triple {158495#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {158495#true} {158495#true} #94#return; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L272 TraceCheckUtils]: 11: Hoare triple {158495#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 12: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 13: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L290 TraceCheckUtils]: 14: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,261 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {158495#true} {158495#true} #96#return; {158495#true} is VALID [2022-04-14 16:10:36,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {158495#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,263 INFO L290 TraceCheckUtils]: 18: Hoare triple {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,263 INFO L290 TraceCheckUtils]: 19: Hoare triple {158548#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,264 INFO L290 TraceCheckUtils]: 21: Hoare triple {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,264 INFO L290 TraceCheckUtils]: 22: Hoare triple {158558#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,265 INFO L272 TraceCheckUtils]: 25: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,265 INFO L290 TraceCheckUtils]: 28: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,266 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {158495#true} {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,266 INFO L272 TraceCheckUtils]: 30: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,266 INFO L290 TraceCheckUtils]: 33: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,267 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {158495#true} {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,267 INFO L272 TraceCheckUtils]: 35: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,268 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {158495#true} {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,268 INFO L272 TraceCheckUtils]: 40: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,268 INFO L290 TraceCheckUtils]: 41: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,269 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {158495#true} {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #104#return; {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {158568#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,270 INFO L272 TraceCheckUtils]: 48: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,271 INFO L290 TraceCheckUtils]: 49: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,271 INFO L290 TraceCheckUtils]: 50: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,271 INFO L290 TraceCheckUtils]: 51: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,271 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {158495#true} {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,271 INFO L272 TraceCheckUtils]: 53: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,272 INFO L290 TraceCheckUtils]: 54: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,272 INFO L290 TraceCheckUtils]: 55: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,272 INFO L290 TraceCheckUtils]: 56: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,272 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {158495#true} {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,272 INFO L272 TraceCheckUtils]: 58: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,273 INFO L290 TraceCheckUtils]: 59: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,273 INFO L290 TraceCheckUtils]: 60: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,273 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {158495#true} {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,273 INFO L272 TraceCheckUtils]: 63: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,273 INFO L290 TraceCheckUtils]: 64: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,274 INFO L290 TraceCheckUtils]: 65: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,274 INFO L290 TraceCheckUtils]: 66: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,274 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {158495#true} {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #104#return; {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,275 INFO L290 TraceCheckUtils]: 68: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {158638#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~v~0 (* main_~b~0 2)) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,277 INFO L290 TraceCheckUtils]: 72: Hoare triple {158711#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,277 INFO L290 TraceCheckUtils]: 73: Hoare triple {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,278 INFO L272 TraceCheckUtils]: 75: Hoare triple {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {158495#true} ~cond := #in~cond; {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:10:36,278 INFO L290 TraceCheckUtils]: 77: Hoare triple {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,279 INFO L290 TraceCheckUtils]: 78: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,279 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #98#return; {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,280 INFO L272 TraceCheckUtils]: 80: Hoare triple {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,280 INFO L290 TraceCheckUtils]: 81: Hoare triple {158495#true} ~cond := #in~cond; {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:10:36,280 INFO L290 TraceCheckUtils]: 82: Hoare triple {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,280 INFO L290 TraceCheckUtils]: 83: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,281 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #100#return; {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,281 INFO L272 TraceCheckUtils]: 85: Hoare triple {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,281 INFO L290 TraceCheckUtils]: 86: Hoare triple {158495#true} ~cond := #in~cond; {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:10:36,282 INFO L290 TraceCheckUtils]: 87: Hoare triple {158734#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,282 INFO L290 TraceCheckUtils]: 88: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:10:36,283 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158721#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= (+ (* (- 2) main_~b~0) main_~a~0) main_~c~0) (= main_~k~0 2) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #102#return; {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,283 INFO L272 TraceCheckUtils]: 90: Hoare triple {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:10:36,283 INFO L290 TraceCheckUtils]: 91: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:10:36,283 INFO L290 TraceCheckUtils]: 92: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:10:36,283 INFO L290 TraceCheckUtils]: 93: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:10:36,284 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {158495#true} {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} #104#return; {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,284 INFO L290 TraceCheckUtils]: 95: Hoare triple {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,285 INFO L290 TraceCheckUtils]: 96: Hoare triple {158775#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~k~0 2) (= main_~q~0 0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,286 INFO L290 TraceCheckUtils]: 97: Hoare triple {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,286 INFO L290 TraceCheckUtils]: 98: Hoare triple {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,287 INFO L290 TraceCheckUtils]: 99: Hoare triple {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} is VALID [2022-04-14 16:10:36,287 INFO L290 TraceCheckUtils]: 100: Hoare triple {158797#(and (= main_~c~0 (+ main_~x~0 (* (- 1) main_~b~0 main_~k~0) (* (- 1) main_~b~0) (* main_~b~0 (+ (- 2) main_~k~0)))) (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= (+ (- 2) main_~k~0) 1) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-14 16:10:36,288 INFO L290 TraceCheckUtils]: 101: Hoare triple {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-14 16:10:36,288 INFO L290 TraceCheckUtils]: 102: Hoare triple {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-14 16:10:36,289 INFO L290 TraceCheckUtils]: 103: Hoare triple {158810#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* main_~a~0 (- 3)) main_~x~0)) (= (+ main_~s~0 (* main_~r~0 3)) 0))} assume !(0 != ~b~0); {158820#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= (+ (* main_~a~0 (- 3)) main_~x~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 (* main_~r~0 3)) 0))} is VALID [2022-04-14 16:10:36,289 INFO L272 TraceCheckUtils]: 104: Hoare triple {158820#(and (= (+ main_~q~0 (* main_~p~0 3)) 1) (= (+ (* main_~a~0 (- 3)) main_~x~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= (+ main_~s~0 (* main_~r~0 3)) 0))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {158824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:10:36,290 INFO L290 TraceCheckUtils]: 105: Hoare triple {158824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {158828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:10:36,290 INFO L290 TraceCheckUtils]: 106: Hoare triple {158828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {158496#false} is VALID [2022-04-14 16:10:36,290 INFO L290 TraceCheckUtils]: 107: Hoare triple {158496#false} assume !false; {158496#false} is VALID [2022-04-14 16:10:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 93 proven. 46 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2022-04-14 16:10:36,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:11:25,126 INFO L290 TraceCheckUtils]: 107: Hoare triple {158496#false} assume !false; {158496#false} is VALID [2022-04-14 16:11:25,126 INFO L290 TraceCheckUtils]: 106: Hoare triple {158828#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {158496#false} is VALID [2022-04-14 16:11:25,127 INFO L290 TraceCheckUtils]: 105: Hoare triple {158824#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {158828#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:11:25,127 INFO L272 TraceCheckUtils]: 104: Hoare triple {158844#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {158824#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:11:25,128 INFO L290 TraceCheckUtils]: 103: Hoare triple {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !(0 != ~b~0); {158844#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 16:11:25,128 INFO L290 TraceCheckUtils]: 102: Hoare triple {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:11:25,129 INFO L290 TraceCheckUtils]: 101: Hoare triple {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:11:25,419 INFO L290 TraceCheckUtils]: 100: Hoare triple {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {158848#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-14 16:11:25,420 INFO L290 TraceCheckUtils]: 99: Hoare triple {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= ~b~0); {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,421 INFO L290 TraceCheckUtils]: 97: Hoare triple {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {158858#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !(~c~0 >= 2 * ~v~0); {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,448 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {158495#true} {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #104#return; {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,448 INFO L290 TraceCheckUtils]: 93: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,448 INFO L290 TraceCheckUtils]: 92: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,448 INFO L290 TraceCheckUtils]: 91: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,448 INFO L272 TraceCheckUtils]: 90: Hoare triple {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,449 INFO L284 TraceCheckUtils]: 89: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158893#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #102#return; {158871#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,450 INFO L290 TraceCheckUtils]: 87: Hoare triple {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,450 INFO L290 TraceCheckUtils]: 86: Hoare triple {158495#true} ~cond := #in~cond; {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:11:25,450 INFO L272 TraceCheckUtils]: 85: Hoare triple {158893#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,451 INFO L284 TraceCheckUtils]: 84: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158910#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #100#return; {158893#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,451 INFO L290 TraceCheckUtils]: 83: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,452 INFO L290 TraceCheckUtils]: 81: Hoare triple {158495#true} ~cond := #in~cond; {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:11:25,452 INFO L272 TraceCheckUtils]: 80: Hoare triple {158910#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,453 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #98#return; {158910#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,453 INFO L290 TraceCheckUtils]: 78: Hoare triple {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {158738#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:11:25,454 INFO L290 TraceCheckUtils]: 76: Hoare triple {158495#true} ~cond := #in~cond; {158903#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 16:11:25,454 INFO L272 TraceCheckUtils]: 75: Hoare triple {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,455 INFO L290 TraceCheckUtils]: 73: Hoare triple {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,568 INFO L290 TraceCheckUtils]: 72: Hoare triple {158495#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {158926#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-14 16:11:25,568 INFO L290 TraceCheckUtils]: 71: Hoare triple {158495#true} assume !!(#t~post7 < 100);havoc #t~post7; {158495#true} is VALID [2022-04-14 16:11:25,568 INFO L290 TraceCheckUtils]: 70: Hoare triple {158495#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {158495#true} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 68: Hoare triple {158495#true} assume !(~c~0 >= 2 * ~v~0); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {158495#true} {158495#true} #104#return; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 66: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L272 TraceCheckUtils]: 63: Hoare triple {158495#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {158495#true} {158495#true} #102#return; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 61: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 60: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 59: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L272 TraceCheckUtils]: 58: Hoare triple {158495#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L284 TraceCheckUtils]: 57: Hoare quadruple {158495#true} {158495#true} #100#return; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,569 INFO L272 TraceCheckUtils]: 53: Hoare triple {158495#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {158495#true} {158495#true} #98#return; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 51: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 50: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 49: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L272 TraceCheckUtils]: 48: Hoare triple {158495#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 47: Hoare triple {158495#true} assume !!(#t~post8 < 100);havoc #t~post8; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 46: Hoare triple {158495#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 45: Hoare triple {158495#true} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {158495#true} {158495#true} #104#return; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 43: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 42: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L272 TraceCheckUtils]: 40: Hoare triple {158495#true} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {158495#true} {158495#true} #102#return; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 38: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 37: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,570 INFO L290 TraceCheckUtils]: 36: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L272 TraceCheckUtils]: 35: Hoare triple {158495#true} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {158495#true} {158495#true} #100#return; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 33: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 32: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 31: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L272 TraceCheckUtils]: 30: Hoare triple {158495#true} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {158495#true} {158495#true} #98#return; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 28: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L272 TraceCheckUtils]: 25: Hoare triple {158495#true} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 24: Hoare triple {158495#true} assume !!(#t~post8 < 100);havoc #t~post8; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {158495#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 22: Hoare triple {158495#true} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 21: Hoare triple {158495#true} assume !!(#t~post7 < 100);havoc #t~post7; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {158495#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158495#true} is VALID [2022-04-14 16:11:25,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {158495#true} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {158495#true} assume !!(#t~post6 < 100);havoc #t~post6; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {158495#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {158495#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {158495#true} {158495#true} #96#return; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 13: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 12: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L272 TraceCheckUtils]: 11: Hoare triple {158495#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {158495#true} {158495#true} #94#return; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {158495#true} assume !(0 == ~cond); {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {158495#true} ~cond := #in~cond; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L272 TraceCheckUtils]: 6: Hoare triple {158495#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {158495#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L272 TraceCheckUtils]: 4: Hoare triple {158495#true} call #t~ret9 := main(); {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158495#true} {158495#true} #108#return; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {158495#true} assume true; {158495#true} is VALID [2022-04-14 16:11:25,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {158495#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {158495#true} is VALID [2022-04-14 16:11:25,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {158495#true} call ULTIMATE.init(); {158495#true} is VALID [2022-04-14 16:11:25,573 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 117 proven. 12 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2022-04-14 16:11:25,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:11:25,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985693025] [2022-04-14 16:11:25,573 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:11:25,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301550686] [2022-04-14 16:11:25,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301550686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:11:25,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:11:25,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 24 [2022-04-14 16:11:25,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617052669] [2022-04-14 16:11:25,574 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:11:25,574 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-04-14 16:11:25,575 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:11:25,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 16:11:26,128 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:11:26,128 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-14 16:11:26,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:11:26,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-14 16:11:26,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2022-04-14 16:11:26,129 INFO L87 Difference]: Start difference. First operand 5690 states and 8106 transitions. Second operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 16:11:35,120 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 16:11:57,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:11:57,515 INFO L93 Difference]: Finished difference Result 6730 states and 9551 transitions. [2022-04-14 16:11:57,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-14 16:11:57,515 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) Word has length 108 [2022-04-14 16:11:57,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:11:57,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 16:11:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 307 transitions. [2022-04-14 16:11:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 16:11:57,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 307 transitions. [2022-04-14 16:11:57,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 307 transitions. [2022-04-14 16:12:00,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:12:02,321 INFO L225 Difference]: With dead ends: 6730 [2022-04-14 16:12:02,322 INFO L226 Difference]: Without dead ends: 6724 [2022-04-14 16:12:02,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 201 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2022-04-14 16:12:02,324 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 191 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 1104 mSolverCounterSat, 312 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 1104 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-04-14 16:12:02,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 607 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 1104 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2022-04-14 16:12:02,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6724 states. [2022-04-14 16:12:12,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6724 to 6108. [2022-04-14 16:12:12,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:12:12,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6724 states. Second operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) [2022-04-14 16:12:12,015 INFO L74 IsIncluded]: Start isIncluded. First operand 6724 states. Second operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) [2022-04-14 16:12:12,018 INFO L87 Difference]: Start difference. First operand 6724 states. Second operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) [2022-04-14 16:12:13,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:12:13,439 INFO L93 Difference]: Finished difference Result 6724 states and 9501 transitions. [2022-04-14 16:12:13,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 9501 transitions. [2022-04-14 16:12:13,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:12:13,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:12:13,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) Second operand 6724 states. [2022-04-14 16:12:13,458 INFO L87 Difference]: Start difference. First operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) Second operand 6724 states. [2022-04-14 16:12:14,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:12:14,834 INFO L93 Difference]: Finished difference Result 6724 states and 9501 transitions. [2022-04-14 16:12:14,834 INFO L276 IsEmpty]: Start isEmpty. Operand 6724 states and 9501 transitions. [2022-04-14 16:12:14,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:12:14,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:12:14,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:12:14,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:12:14,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6108 states, 3995 states have (on average 1.3053817271589487) internal successors, (5215), 4017 states have internal predecessors, (5215), 1781 states have call successors, (1781), 333 states have call predecessors, (1781), 331 states have return successors, (1779), 1757 states have call predecessors, (1779), 1779 states have call successors, (1779) [2022-04-14 16:12:16,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6108 states to 6108 states and 8775 transitions. [2022-04-14 16:12:16,367 INFO L78 Accepts]: Start accepts. Automaton has 6108 states and 8775 transitions. Word has length 108 [2022-04-14 16:12:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:12:16,367 INFO L478 AbstractCegarLoop]: Abstraction has 6108 states and 8775 transitions. [2022-04-14 16:12:16,368 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 20 states have (on average 3.45) internal successors, (69), 21 states have internal predecessors, (69), 11 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (23), 8 states have call predecessors, (23), 9 states have call successors, (23) [2022-04-14 16:12:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6108 states and 8775 transitions. [2022-04-14 16:12:16,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-14 16:12:16,368 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:12:16,369 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:12:16,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-14 16:12:16,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-14 16:12:16,569 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:12:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:12:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash -193506847, now seen corresponding path program 1 times [2022-04-14 16:12:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:12:16,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277926645] [2022-04-14 16:12:16,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:12:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:12:16,580 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:12:16,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19549974] [2022-04-14 16:12:16,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:12:16,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:12:16,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:12:16,582 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:12:16,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-14 16:12:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:12:16,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-14 16:12:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:12:16,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:12:16,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {191674#true} call ULTIMATE.init(); {191674#true} is VALID [2022-04-14 16:12:16,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {191674#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {191682#(<= ~counter~0 0)} assume true; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,955 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191682#(<= ~counter~0 0)} {191674#true} #108#return; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {191682#(<= ~counter~0 0)} call #t~ret9 := main(); {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {191682#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,955 INFO L272 TraceCheckUtils]: 6: Hoare triple {191682#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {191682#(<= ~counter~0 0)} ~cond := #in~cond; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {191682#(<= ~counter~0 0)} assume !(0 == ~cond); {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {191682#(<= ~counter~0 0)} assume true; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {191682#(<= ~counter~0 0)} {191682#(<= ~counter~0 0)} #94#return; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,956 INFO L272 TraceCheckUtils]: 11: Hoare triple {191682#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {191682#(<= ~counter~0 0)} ~cond := #in~cond; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {191682#(<= ~counter~0 0)} assume !(0 == ~cond); {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {191682#(<= ~counter~0 0)} assume true; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {191682#(<= ~counter~0 0)} {191682#(<= ~counter~0 0)} #96#return; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {191682#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {191682#(<= ~counter~0 0)} is VALID [2022-04-14 16:12:16,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {191682#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191731#(<= ~counter~0 1)} is VALID [2022-04-14 16:12:16,959 INFO L290 TraceCheckUtils]: 18: Hoare triple {191731#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {191731#(<= ~counter~0 1)} is VALID [2022-04-14 16:12:16,959 INFO L290 TraceCheckUtils]: 19: Hoare triple {191731#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {191731#(<= ~counter~0 1)} is VALID [2022-04-14 16:12:16,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {191731#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191741#(<= ~counter~0 2)} is VALID [2022-04-14 16:12:16,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {191741#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {191741#(<= ~counter~0 2)} is VALID [2022-04-14 16:12:16,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {191741#(<= ~counter~0 2)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {191741#(<= ~counter~0 2)} is VALID [2022-04-14 16:12:16,961 INFO L290 TraceCheckUtils]: 23: Hoare triple {191741#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,961 INFO L290 TraceCheckUtils]: 24: Hoare triple {191751#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,961 INFO L272 TraceCheckUtils]: 25: Hoare triple {191751#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,961 INFO L290 TraceCheckUtils]: 26: Hoare triple {191751#(<= ~counter~0 3)} ~cond := #in~cond; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {191751#(<= ~counter~0 3)} assume !(0 == ~cond); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,962 INFO L290 TraceCheckUtils]: 28: Hoare triple {191751#(<= ~counter~0 3)} assume true; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,962 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {191751#(<= ~counter~0 3)} {191751#(<= ~counter~0 3)} #98#return; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,962 INFO L272 TraceCheckUtils]: 30: Hoare triple {191751#(<= ~counter~0 3)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {191751#(<= ~counter~0 3)} ~cond := #in~cond; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,963 INFO L290 TraceCheckUtils]: 32: Hoare triple {191751#(<= ~counter~0 3)} assume !(0 == ~cond); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {191751#(<= ~counter~0 3)} assume true; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,963 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {191751#(<= ~counter~0 3)} {191751#(<= ~counter~0 3)} #100#return; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,963 INFO L272 TraceCheckUtils]: 35: Hoare triple {191751#(<= ~counter~0 3)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {191751#(<= ~counter~0 3)} ~cond := #in~cond; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {191751#(<= ~counter~0 3)} assume !(0 == ~cond); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {191751#(<= ~counter~0 3)} assume true; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,964 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {191751#(<= ~counter~0 3)} {191751#(<= ~counter~0 3)} #102#return; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,964 INFO L272 TraceCheckUtils]: 40: Hoare triple {191751#(<= ~counter~0 3)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,965 INFO L290 TraceCheckUtils]: 41: Hoare triple {191751#(<= ~counter~0 3)} ~cond := #in~cond; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,965 INFO L290 TraceCheckUtils]: 42: Hoare triple {191751#(<= ~counter~0 3)} assume !(0 == ~cond); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,965 INFO L290 TraceCheckUtils]: 43: Hoare triple {191751#(<= ~counter~0 3)} assume true; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,965 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {191751#(<= ~counter~0 3)} {191751#(<= ~counter~0 3)} #104#return; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,965 INFO L290 TraceCheckUtils]: 45: Hoare triple {191751#(<= ~counter~0 3)} assume !(~c~0 >= 2 * ~v~0); {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,966 INFO L290 TraceCheckUtils]: 46: Hoare triple {191751#(<= ~counter~0 3)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {191751#(<= ~counter~0 3)} is VALID [2022-04-14 16:12:16,966 INFO L290 TraceCheckUtils]: 47: Hoare triple {191751#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191824#(<= ~counter~0 4)} is VALID [2022-04-14 16:12:16,966 INFO L290 TraceCheckUtils]: 48: Hoare triple {191824#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {191824#(<= ~counter~0 4)} is VALID [2022-04-14 16:12:16,967 INFO L290 TraceCheckUtils]: 49: Hoare triple {191824#(<= ~counter~0 4)} assume !(~c~0 >= ~b~0); {191824#(<= ~counter~0 4)} is VALID [2022-04-14 16:12:16,967 INFO L290 TraceCheckUtils]: 50: Hoare triple {191824#(<= ~counter~0 4)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {191824#(<= ~counter~0 4)} is VALID [2022-04-14 16:12:16,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {191824#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191837#(<= ~counter~0 5)} is VALID [2022-04-14 16:12:16,968 INFO L290 TraceCheckUtils]: 52: Hoare triple {191837#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {191837#(<= ~counter~0 5)} is VALID [2022-04-14 16:12:16,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {191837#(<= ~counter~0 5)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {191837#(<= ~counter~0 5)} is VALID [2022-04-14 16:12:16,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {191837#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191847#(<= ~counter~0 6)} is VALID [2022-04-14 16:12:16,969 INFO L290 TraceCheckUtils]: 55: Hoare triple {191847#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {191847#(<= ~counter~0 6)} is VALID [2022-04-14 16:12:16,969 INFO L290 TraceCheckUtils]: 56: Hoare triple {191847#(<= ~counter~0 6)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {191847#(<= ~counter~0 6)} is VALID [2022-04-14 16:12:16,969 INFO L290 TraceCheckUtils]: 57: Hoare triple {191847#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {191857#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,970 INFO L272 TraceCheckUtils]: 59: Hoare triple {191857#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,970 INFO L290 TraceCheckUtils]: 60: Hoare triple {191857#(<= ~counter~0 7)} ~cond := #in~cond; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,970 INFO L290 TraceCheckUtils]: 61: Hoare triple {191857#(<= ~counter~0 7)} assume !(0 == ~cond); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,970 INFO L290 TraceCheckUtils]: 62: Hoare triple {191857#(<= ~counter~0 7)} assume true; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,971 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {191857#(<= ~counter~0 7)} {191857#(<= ~counter~0 7)} #98#return; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,971 INFO L272 TraceCheckUtils]: 64: Hoare triple {191857#(<= ~counter~0 7)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,971 INFO L290 TraceCheckUtils]: 65: Hoare triple {191857#(<= ~counter~0 7)} ~cond := #in~cond; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {191857#(<= ~counter~0 7)} assume !(0 == ~cond); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,971 INFO L290 TraceCheckUtils]: 67: Hoare triple {191857#(<= ~counter~0 7)} assume true; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,972 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {191857#(<= ~counter~0 7)} {191857#(<= ~counter~0 7)} #100#return; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,972 INFO L272 TraceCheckUtils]: 69: Hoare triple {191857#(<= ~counter~0 7)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,972 INFO L290 TraceCheckUtils]: 70: Hoare triple {191857#(<= ~counter~0 7)} ~cond := #in~cond; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,972 INFO L290 TraceCheckUtils]: 71: Hoare triple {191857#(<= ~counter~0 7)} assume !(0 == ~cond); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,973 INFO L290 TraceCheckUtils]: 72: Hoare triple {191857#(<= ~counter~0 7)} assume true; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,973 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {191857#(<= ~counter~0 7)} {191857#(<= ~counter~0 7)} #102#return; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,974 INFO L272 TraceCheckUtils]: 74: Hoare triple {191857#(<= ~counter~0 7)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,974 INFO L290 TraceCheckUtils]: 75: Hoare triple {191857#(<= ~counter~0 7)} ~cond := #in~cond; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,974 INFO L290 TraceCheckUtils]: 76: Hoare triple {191857#(<= ~counter~0 7)} assume !(0 == ~cond); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,974 INFO L290 TraceCheckUtils]: 77: Hoare triple {191857#(<= ~counter~0 7)} assume true; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,975 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {191857#(<= ~counter~0 7)} {191857#(<= ~counter~0 7)} #104#return; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {191857#(<= ~counter~0 7)} assume !(~c~0 >= 2 * ~v~0); {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {191857#(<= ~counter~0 7)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {191857#(<= ~counter~0 7)} is VALID [2022-04-14 16:12:16,976 INFO L290 TraceCheckUtils]: 81: Hoare triple {191857#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191930#(<= ~counter~0 8)} is VALID [2022-04-14 16:12:16,976 INFO L290 TraceCheckUtils]: 82: Hoare triple {191930#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {191930#(<= ~counter~0 8)} is VALID [2022-04-14 16:12:16,976 INFO L290 TraceCheckUtils]: 83: Hoare triple {191930#(<= ~counter~0 8)} assume !(~c~0 >= ~b~0); {191930#(<= ~counter~0 8)} is VALID [2022-04-14 16:12:16,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {191930#(<= ~counter~0 8)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {191930#(<= ~counter~0 8)} is VALID [2022-04-14 16:12:16,977 INFO L290 TraceCheckUtils]: 85: Hoare triple {191930#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191943#(<= ~counter~0 9)} is VALID [2022-04-14 16:12:16,977 INFO L290 TraceCheckUtils]: 86: Hoare triple {191943#(<= ~counter~0 9)} assume !!(#t~post6 < 100);havoc #t~post6; {191943#(<= ~counter~0 9)} is VALID [2022-04-14 16:12:16,977 INFO L290 TraceCheckUtils]: 87: Hoare triple {191943#(<= ~counter~0 9)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {191943#(<= ~counter~0 9)} is VALID [2022-04-14 16:12:16,978 INFO L290 TraceCheckUtils]: 88: Hoare triple {191943#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191953#(<= ~counter~0 10)} is VALID [2022-04-14 16:12:16,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {191953#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {191953#(<= ~counter~0 10)} is VALID [2022-04-14 16:12:16,978 INFO L290 TraceCheckUtils]: 90: Hoare triple {191953#(<= ~counter~0 10)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {191953#(<= ~counter~0 10)} is VALID [2022-04-14 16:12:16,978 INFO L290 TraceCheckUtils]: 91: Hoare triple {191953#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191963#(<= |main_#t~post8| 10)} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 92: Hoare triple {191963#(<= |main_#t~post8| 10)} assume !(#t~post8 < 100);havoc #t~post8; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 93: Hoare triple {191675#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 94: Hoare triple {191675#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 95: Hoare triple {191675#false} assume !!(#t~post7 < 100);havoc #t~post7; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 96: Hoare triple {191675#false} assume !(~c~0 >= ~b~0); {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 97: Hoare triple {191675#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 98: Hoare triple {191675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {191675#false} assume !!(#t~post6 < 100);havoc #t~post6; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {191675#false} assume !(0 != ~b~0); {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L272 TraceCheckUtils]: 101: Hoare triple {191675#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 102: Hoare triple {191675#false} ~cond := #in~cond; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 103: Hoare triple {191675#false} assume 0 == ~cond; {191675#false} is VALID [2022-04-14 16:12:16,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {191675#false} assume !false; {191675#false} is VALID [2022-04-14 16:12:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 116 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-04-14 16:12:16,980 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 104: Hoare triple {191675#false} assume !false; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 103: Hoare triple {191675#false} assume 0 == ~cond; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 102: Hoare triple {191675#false} ~cond := #in~cond; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L272 TraceCheckUtils]: 101: Hoare triple {191675#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 100: Hoare triple {191675#false} assume !(0 != ~b~0); {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 99: Hoare triple {191675#false} assume !!(#t~post6 < 100);havoc #t~post6; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 98: Hoare triple {191675#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 97: Hoare triple {191675#false} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 96: Hoare triple {191675#false} assume !(~c~0 >= ~b~0); {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 95: Hoare triple {191675#false} assume !!(#t~post7 < 100);havoc #t~post7; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 94: Hoare triple {191675#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191675#false} is VALID [2022-04-14 16:12:17,412 INFO L290 TraceCheckUtils]: 93: Hoare triple {191675#false} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {191675#false} is VALID [2022-04-14 16:12:17,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {192039#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {191675#false} is VALID [2022-04-14 16:12:17,413 INFO L290 TraceCheckUtils]: 91: Hoare triple {192043#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192039#(< |main_#t~post8| 100)} is VALID [2022-04-14 16:12:17,413 INFO L290 TraceCheckUtils]: 90: Hoare triple {192043#(< ~counter~0 100)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {192043#(< ~counter~0 100)} is VALID [2022-04-14 16:12:17,413 INFO L290 TraceCheckUtils]: 89: Hoare triple {192043#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {192043#(< ~counter~0 100)} is VALID [2022-04-14 16:12:17,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {192053#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192043#(< ~counter~0 100)} is VALID [2022-04-14 16:12:17,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {192053#(< ~counter~0 99)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {192053#(< ~counter~0 99)} is VALID [2022-04-14 16:12:17,415 INFO L290 TraceCheckUtils]: 86: Hoare triple {192053#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {192053#(< ~counter~0 99)} is VALID [2022-04-14 16:12:17,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {192063#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192053#(< ~counter~0 99)} is VALID [2022-04-14 16:12:17,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {192063#(< ~counter~0 98)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {192063#(< ~counter~0 98)} is VALID [2022-04-14 16:12:17,416 INFO L290 TraceCheckUtils]: 83: Hoare triple {192063#(< ~counter~0 98)} assume !(~c~0 >= ~b~0); {192063#(< ~counter~0 98)} is VALID [2022-04-14 16:12:17,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {192063#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {192063#(< ~counter~0 98)} is VALID [2022-04-14 16:12:17,417 INFO L290 TraceCheckUtils]: 81: Hoare triple {192076#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192063#(< ~counter~0 98)} is VALID [2022-04-14 16:12:17,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {192076#(< ~counter~0 97)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {192076#(< ~counter~0 97)} assume !(~c~0 >= 2 * ~v~0); {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,418 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {191674#true} {192076#(< ~counter~0 97)} #104#return; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,418 INFO L290 TraceCheckUtils]: 77: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,418 INFO L290 TraceCheckUtils]: 76: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,418 INFO L290 TraceCheckUtils]: 75: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,418 INFO L272 TraceCheckUtils]: 74: Hoare triple {192076#(< ~counter~0 97)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,419 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {191674#true} {192076#(< ~counter~0 97)} #102#return; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,419 INFO L290 TraceCheckUtils]: 72: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,419 INFO L290 TraceCheckUtils]: 70: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,419 INFO L272 TraceCheckUtils]: 69: Hoare triple {192076#(< ~counter~0 97)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,419 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {191674#true} {192076#(< ~counter~0 97)} #100#return; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,419 INFO L290 TraceCheckUtils]: 67: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L290 TraceCheckUtils]: 66: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L290 TraceCheckUtils]: 65: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L272 TraceCheckUtils]: 64: Hoare triple {192076#(< ~counter~0 97)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {191674#true} {192076#(< ~counter~0 97)} #98#return; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,420 INFO L290 TraceCheckUtils]: 62: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L290 TraceCheckUtils]: 61: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L290 TraceCheckUtils]: 60: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,420 INFO L272 TraceCheckUtils]: 59: Hoare triple {192076#(< ~counter~0 97)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,421 INFO L290 TraceCheckUtils]: 58: Hoare triple {192076#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,421 INFO L290 TraceCheckUtils]: 57: Hoare triple {192149#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192076#(< ~counter~0 97)} is VALID [2022-04-14 16:12:17,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {192149#(< ~counter~0 96)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {192149#(< ~counter~0 96)} is VALID [2022-04-14 16:12:17,422 INFO L290 TraceCheckUtils]: 55: Hoare triple {192149#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {192149#(< ~counter~0 96)} is VALID [2022-04-14 16:12:17,422 INFO L290 TraceCheckUtils]: 54: Hoare triple {192159#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192149#(< ~counter~0 96)} is VALID [2022-04-14 16:12:17,423 INFO L290 TraceCheckUtils]: 53: Hoare triple {192159#(< ~counter~0 95)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {192159#(< ~counter~0 95)} is VALID [2022-04-14 16:12:17,423 INFO L290 TraceCheckUtils]: 52: Hoare triple {192159#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {192159#(< ~counter~0 95)} is VALID [2022-04-14 16:12:17,424 INFO L290 TraceCheckUtils]: 51: Hoare triple {192169#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192159#(< ~counter~0 95)} is VALID [2022-04-14 16:12:17,424 INFO L290 TraceCheckUtils]: 50: Hoare triple {192169#(< ~counter~0 94)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {192169#(< ~counter~0 94)} is VALID [2022-04-14 16:12:17,424 INFO L290 TraceCheckUtils]: 49: Hoare triple {192169#(< ~counter~0 94)} assume !(~c~0 >= ~b~0); {192169#(< ~counter~0 94)} is VALID [2022-04-14 16:12:17,424 INFO L290 TraceCheckUtils]: 48: Hoare triple {192169#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {192169#(< ~counter~0 94)} is VALID [2022-04-14 16:12:17,425 INFO L290 TraceCheckUtils]: 47: Hoare triple {192182#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192169#(< ~counter~0 94)} is VALID [2022-04-14 16:12:17,425 INFO L290 TraceCheckUtils]: 46: Hoare triple {192182#(< ~counter~0 93)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,425 INFO L290 TraceCheckUtils]: 45: Hoare triple {192182#(< ~counter~0 93)} assume !(~c~0 >= 2 * ~v~0); {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,426 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {191674#true} {192182#(< ~counter~0 93)} #104#return; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,426 INFO L290 TraceCheckUtils]: 41: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,426 INFO L272 TraceCheckUtils]: 40: Hoare triple {192182#(< ~counter~0 93)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,426 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {191674#true} {192182#(< ~counter~0 93)} #102#return; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,426 INFO L290 TraceCheckUtils]: 38: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L290 TraceCheckUtils]: 37: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L290 TraceCheckUtils]: 36: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L272 TraceCheckUtils]: 35: Hoare triple {192182#(< ~counter~0 93)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {191674#true} {192182#(< ~counter~0 93)} #100#return; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,427 INFO L272 TraceCheckUtils]: 30: Hoare triple {192182#(< ~counter~0 93)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,428 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {191674#true} {192182#(< ~counter~0 93)} #98#return; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,428 INFO L290 TraceCheckUtils]: 28: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,428 INFO L290 TraceCheckUtils]: 27: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,428 INFO L290 TraceCheckUtils]: 26: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,428 INFO L272 TraceCheckUtils]: 25: Hoare triple {192182#(< ~counter~0 93)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,428 INFO L290 TraceCheckUtils]: 24: Hoare triple {192182#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {192255#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192182#(< ~counter~0 93)} is VALID [2022-04-14 16:12:17,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {192255#(< ~counter~0 92)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {192255#(< ~counter~0 92)} is VALID [2022-04-14 16:12:17,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {192255#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {192255#(< ~counter~0 92)} is VALID [2022-04-14 16:12:17,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {192265#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192255#(< ~counter~0 92)} is VALID [2022-04-14 16:12:17,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {192265#(< ~counter~0 91)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {192265#(< ~counter~0 91)} is VALID [2022-04-14 16:12:17,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {192265#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {192265#(< ~counter~0 91)} is VALID [2022-04-14 16:12:17,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {192275#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192265#(< ~counter~0 91)} is VALID [2022-04-14 16:12:17,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {192275#(< ~counter~0 90)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,432 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {191674#true} {192275#(< ~counter~0 90)} #96#return; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L272 TraceCheckUtils]: 11: Hoare triple {192275#(< ~counter~0 90)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {191674#true} {192275#(< ~counter~0 90)} #94#return; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {191674#true} assume true; {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {191674#true} assume !(0 == ~cond); {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {191674#true} ~cond := #in~cond; {191674#true} is VALID [2022-04-14 16:12:17,432 INFO L272 TraceCheckUtils]: 6: Hoare triple {192275#(< ~counter~0 90)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {191674#true} is VALID [2022-04-14 16:12:17,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {192275#(< ~counter~0 90)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,433 INFO L272 TraceCheckUtils]: 4: Hoare triple {192275#(< ~counter~0 90)} call #t~ret9 := main(); {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,433 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192275#(< ~counter~0 90)} {191674#true} #108#return; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {192275#(< ~counter~0 90)} assume true; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {191674#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {192275#(< ~counter~0 90)} is VALID [2022-04-14 16:12:17,434 INFO L272 TraceCheckUtils]: 0: Hoare triple {191674#true} call ULTIMATE.init(); {191674#true} is VALID [2022-04-14 16:12:17,434 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 44 proven. 52 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-14 16:12:17,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:12:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277926645] [2022-04-14 16:12:17,434 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:12:17,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19549974] [2022-04-14 16:12:17,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19549974] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:12:17,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:12:17,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-14 16:12:17,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127267701] [2022-04-14 16:12:17,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:12:17,436 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-04-14 16:12:17,436 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:12:17,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:12:17,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:12:17,572 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-14 16:12:17,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:12:17,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-14 16:12:17,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-14 16:12:17,572 INFO L87 Difference]: Start difference. First operand 6108 states and 8775 transitions. Second operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:12:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:12:41,772 INFO L93 Difference]: Finished difference Result 10671 states and 15491 transitions. [2022-04-14 16:12:41,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-14 16:12:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) Word has length 105 [2022-04-14 16:12:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:12:41,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:12:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 600 transitions. [2022-04-14 16:12:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:12:41,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 600 transitions. [2022-04-14 16:12:41,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 600 transitions. [2022-04-14 16:12:42,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 600 edges. 600 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:12:44,605 INFO L225 Difference]: With dead ends: 10671 [2022-04-14 16:12:44,605 INFO L226 Difference]: Without dead ends: 7125 [2022-04-14 16:12:44,611 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=708, Invalid=1272, Unknown=0, NotChecked=0, Total=1980 [2022-04-14 16:12:44,611 INFO L913 BasicCegarLoop]: 120 mSDtfsCounter, 630 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-14 16:12:44,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [630 Valid, 757 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-14 16:12:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7125 states. [2022-04-14 16:12:56,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7125 to 6950. [2022-04-14 16:12:56,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:12:56,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7125 states. Second operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) [2022-04-14 16:12:56,884 INFO L74 IsIncluded]: Start isIncluded. First operand 7125 states. Second operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) [2022-04-14 16:12:56,891 INFO L87 Difference]: Start difference. First operand 7125 states. Second operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) [2022-04-14 16:12:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:12:58,404 INFO L93 Difference]: Finished difference Result 7125 states and 9813 transitions. [2022-04-14 16:12:58,404 INFO L276 IsEmpty]: Start isEmpty. Operand 7125 states and 9813 transitions. [2022-04-14 16:12:58,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:12:58,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:12:58,422 INFO L74 IsIncluded]: Start isIncluded. First operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) Second operand 7125 states. [2022-04-14 16:12:58,429 INFO L87 Difference]: Start difference. First operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) Second operand 7125 states. [2022-04-14 16:13:00,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:00,037 INFO L93 Difference]: Finished difference Result 7125 states and 9813 transitions. [2022-04-14 16:13:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7125 states and 9813 transitions. [2022-04-14 16:13:00,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:13:00,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:13:00,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:13:00,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:13:00,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6950 states, 4495 states have (on average 1.2202447163515018) internal successors, (5485), 4513 states have internal predecessors, (5485), 2077 states have call successors, (2077), 379 states have call predecessors, (2077), 377 states have return successors, (2075), 2057 states have call predecessors, (2075), 2075 states have call successors, (2075) [2022-04-14 16:13:02,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6950 states to 6950 states and 9637 transitions. [2022-04-14 16:13:02,186 INFO L78 Accepts]: Start accepts. Automaton has 6950 states and 9637 transitions. Word has length 105 [2022-04-14 16:13:02,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:13:02,187 INFO L478 AbstractCegarLoop]: Abstraction has 6950 states and 9637 transitions. [2022-04-14 16:13:02,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.076923076923077) internal successors, (106), 26 states have internal predecessors, (106), 8 states have call successors, (24), 6 states have call predecessors, (24), 5 states have return successors, (22), 6 states have call predecessors, (22), 7 states have call successors, (22) [2022-04-14 16:13:02,187 INFO L276 IsEmpty]: Start isEmpty. Operand 6950 states and 9637 transitions. [2022-04-14 16:13:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-14 16:13:02,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:13:02,188 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:13:02,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-14 16:13:02,400 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-14 16:13:02,400 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:13:02,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:13:02,401 INFO L85 PathProgramCache]: Analyzing trace with hash 862891816, now seen corresponding path program 2 times [2022-04-14 16:13:02,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:13:02,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191693185] [2022-04-14 16:13:02,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:13:02,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:13:02,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:13:02,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1027577543] [2022-04-14 16:13:02,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 16:13:02,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:13:02,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:13:02,424 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:13:02,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-14 16:13:02,510 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 16:13:02,510 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:13:02,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-14 16:13:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:13:02,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:13:02,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {232990#true} call ULTIMATE.init(); {232990#true} is VALID [2022-04-14 16:13:02,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {232990#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {232998#(<= ~counter~0 0)} assume true; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232998#(<= ~counter~0 0)} {232990#true} #108#return; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {232998#(<= ~counter~0 0)} call #t~ret9 := main(); {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {232998#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {232998#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {232998#(<= ~counter~0 0)} ~cond := #in~cond; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {232998#(<= ~counter~0 0)} assume !(0 == ~cond); {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {232998#(<= ~counter~0 0)} assume true; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,907 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {232998#(<= ~counter~0 0)} {232998#(<= ~counter~0 0)} #94#return; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,907 INFO L272 TraceCheckUtils]: 11: Hoare triple {232998#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {232998#(<= ~counter~0 0)} ~cond := #in~cond; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,907 INFO L290 TraceCheckUtils]: 13: Hoare triple {232998#(<= ~counter~0 0)} assume !(0 == ~cond); {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {232998#(<= ~counter~0 0)} assume true; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,908 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {232998#(<= ~counter~0 0)} {232998#(<= ~counter~0 0)} #96#return; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {232998#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {232998#(<= ~counter~0 0)} is VALID [2022-04-14 16:13:02,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {232998#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233047#(<= ~counter~0 1)} is VALID [2022-04-14 16:13:02,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {233047#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {233047#(<= ~counter~0 1)} is VALID [2022-04-14 16:13:02,910 INFO L290 TraceCheckUtils]: 19: Hoare triple {233047#(<= ~counter~0 1)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233047#(<= ~counter~0 1)} is VALID [2022-04-14 16:13:02,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {233047#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233057#(<= ~counter~0 2)} is VALID [2022-04-14 16:13:02,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {233057#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {233057#(<= ~counter~0 2)} is VALID [2022-04-14 16:13:02,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {233057#(<= ~counter~0 2)} assume !(~c~0 >= ~b~0); {233057#(<= ~counter~0 2)} is VALID [2022-04-14 16:13:02,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {233057#(<= ~counter~0 2)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233057#(<= ~counter~0 2)} is VALID [2022-04-14 16:13:02,911 INFO L290 TraceCheckUtils]: 24: Hoare triple {233057#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233070#(<= ~counter~0 3)} is VALID [2022-04-14 16:13:02,912 INFO L290 TraceCheckUtils]: 25: Hoare triple {233070#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {233070#(<= ~counter~0 3)} is VALID [2022-04-14 16:13:02,912 INFO L290 TraceCheckUtils]: 26: Hoare triple {233070#(<= ~counter~0 3)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233070#(<= ~counter~0 3)} is VALID [2022-04-14 16:13:02,912 INFO L290 TraceCheckUtils]: 27: Hoare triple {233070#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233080#(<= ~counter~0 4)} is VALID [2022-04-14 16:13:02,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {233080#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {233080#(<= ~counter~0 4)} is VALID [2022-04-14 16:13:02,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {233080#(<= ~counter~0 4)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233080#(<= ~counter~0 4)} is VALID [2022-04-14 16:13:02,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {233080#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,914 INFO L290 TraceCheckUtils]: 31: Hoare triple {233090#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,914 INFO L272 TraceCheckUtils]: 32: Hoare triple {233090#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,914 INFO L290 TraceCheckUtils]: 33: Hoare triple {233090#(<= ~counter~0 5)} ~cond := #in~cond; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,914 INFO L290 TraceCheckUtils]: 34: Hoare triple {233090#(<= ~counter~0 5)} assume !(0 == ~cond); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {233090#(<= ~counter~0 5)} assume true; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,915 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {233090#(<= ~counter~0 5)} {233090#(<= ~counter~0 5)} #98#return; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,915 INFO L272 TraceCheckUtils]: 37: Hoare triple {233090#(<= ~counter~0 5)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {233090#(<= ~counter~0 5)} ~cond := #in~cond; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {233090#(<= ~counter~0 5)} assume !(0 == ~cond); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,916 INFO L290 TraceCheckUtils]: 40: Hoare triple {233090#(<= ~counter~0 5)} assume true; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,916 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {233090#(<= ~counter~0 5)} {233090#(<= ~counter~0 5)} #100#return; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,916 INFO L272 TraceCheckUtils]: 42: Hoare triple {233090#(<= ~counter~0 5)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,916 INFO L290 TraceCheckUtils]: 43: Hoare triple {233090#(<= ~counter~0 5)} ~cond := #in~cond; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {233090#(<= ~counter~0 5)} assume !(0 == ~cond); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {233090#(<= ~counter~0 5)} assume true; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,917 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {233090#(<= ~counter~0 5)} {233090#(<= ~counter~0 5)} #102#return; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,917 INFO L272 TraceCheckUtils]: 47: Hoare triple {233090#(<= ~counter~0 5)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,917 INFO L290 TraceCheckUtils]: 48: Hoare triple {233090#(<= ~counter~0 5)} ~cond := #in~cond; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,918 INFO L290 TraceCheckUtils]: 49: Hoare triple {233090#(<= ~counter~0 5)} assume !(0 == ~cond); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,918 INFO L290 TraceCheckUtils]: 50: Hoare triple {233090#(<= ~counter~0 5)} assume true; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,918 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {233090#(<= ~counter~0 5)} {233090#(<= ~counter~0 5)} #104#return; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,918 INFO L290 TraceCheckUtils]: 52: Hoare triple {233090#(<= ~counter~0 5)} assume !(~c~0 >= 2 * ~v~0); {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,918 INFO L290 TraceCheckUtils]: 53: Hoare triple {233090#(<= ~counter~0 5)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233090#(<= ~counter~0 5)} is VALID [2022-04-14 16:13:02,919 INFO L290 TraceCheckUtils]: 54: Hoare triple {233090#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233163#(<= ~counter~0 6)} is VALID [2022-04-14 16:13:02,919 INFO L290 TraceCheckUtils]: 55: Hoare triple {233163#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {233163#(<= ~counter~0 6)} is VALID [2022-04-14 16:13:02,919 INFO L290 TraceCheckUtils]: 56: Hoare triple {233163#(<= ~counter~0 6)} assume !(~c~0 >= ~b~0); {233163#(<= ~counter~0 6)} is VALID [2022-04-14 16:13:02,920 INFO L290 TraceCheckUtils]: 57: Hoare triple {233163#(<= ~counter~0 6)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233163#(<= ~counter~0 6)} is VALID [2022-04-14 16:13:02,920 INFO L290 TraceCheckUtils]: 58: Hoare triple {233163#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233176#(<= ~counter~0 7)} is VALID [2022-04-14 16:13:02,920 INFO L290 TraceCheckUtils]: 59: Hoare triple {233176#(<= ~counter~0 7)} assume !!(#t~post6 < 100);havoc #t~post6; {233176#(<= ~counter~0 7)} is VALID [2022-04-14 16:13:02,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {233176#(<= ~counter~0 7)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233176#(<= ~counter~0 7)} is VALID [2022-04-14 16:13:02,921 INFO L290 TraceCheckUtils]: 61: Hoare triple {233176#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233186#(<= ~counter~0 8)} is VALID [2022-04-14 16:13:02,921 INFO L290 TraceCheckUtils]: 62: Hoare triple {233186#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {233186#(<= ~counter~0 8)} is VALID [2022-04-14 16:13:02,921 INFO L290 TraceCheckUtils]: 63: Hoare triple {233186#(<= ~counter~0 8)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233186#(<= ~counter~0 8)} is VALID [2022-04-14 16:13:02,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {233186#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {233196#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,923 INFO L272 TraceCheckUtils]: 66: Hoare triple {233196#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,923 INFO L290 TraceCheckUtils]: 67: Hoare triple {233196#(<= ~counter~0 9)} ~cond := #in~cond; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,923 INFO L290 TraceCheckUtils]: 68: Hoare triple {233196#(<= ~counter~0 9)} assume !(0 == ~cond); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,923 INFO L290 TraceCheckUtils]: 69: Hoare triple {233196#(<= ~counter~0 9)} assume true; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,923 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {233196#(<= ~counter~0 9)} {233196#(<= ~counter~0 9)} #98#return; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,924 INFO L272 TraceCheckUtils]: 71: Hoare triple {233196#(<= ~counter~0 9)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,924 INFO L290 TraceCheckUtils]: 72: Hoare triple {233196#(<= ~counter~0 9)} ~cond := #in~cond; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,924 INFO L290 TraceCheckUtils]: 73: Hoare triple {233196#(<= ~counter~0 9)} assume !(0 == ~cond); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,924 INFO L290 TraceCheckUtils]: 74: Hoare triple {233196#(<= ~counter~0 9)} assume true; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,925 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {233196#(<= ~counter~0 9)} {233196#(<= ~counter~0 9)} #100#return; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,925 INFO L272 TraceCheckUtils]: 76: Hoare triple {233196#(<= ~counter~0 9)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,925 INFO L290 TraceCheckUtils]: 77: Hoare triple {233196#(<= ~counter~0 9)} ~cond := #in~cond; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,925 INFO L290 TraceCheckUtils]: 78: Hoare triple {233196#(<= ~counter~0 9)} assume !(0 == ~cond); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,925 INFO L290 TraceCheckUtils]: 79: Hoare triple {233196#(<= ~counter~0 9)} assume true; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,926 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {233196#(<= ~counter~0 9)} {233196#(<= ~counter~0 9)} #102#return; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,926 INFO L272 TraceCheckUtils]: 81: Hoare triple {233196#(<= ~counter~0 9)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,926 INFO L290 TraceCheckUtils]: 82: Hoare triple {233196#(<= ~counter~0 9)} ~cond := #in~cond; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,926 INFO L290 TraceCheckUtils]: 83: Hoare triple {233196#(<= ~counter~0 9)} assume !(0 == ~cond); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,926 INFO L290 TraceCheckUtils]: 84: Hoare triple {233196#(<= ~counter~0 9)} assume true; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,927 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {233196#(<= ~counter~0 9)} {233196#(<= ~counter~0 9)} #104#return; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,927 INFO L290 TraceCheckUtils]: 86: Hoare triple {233196#(<= ~counter~0 9)} assume !(~c~0 >= 2 * ~v~0); {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,927 INFO L290 TraceCheckUtils]: 87: Hoare triple {233196#(<= ~counter~0 9)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233196#(<= ~counter~0 9)} is VALID [2022-04-14 16:13:02,928 INFO L290 TraceCheckUtils]: 88: Hoare triple {233196#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233269#(<= ~counter~0 10)} is VALID [2022-04-14 16:13:02,928 INFO L290 TraceCheckUtils]: 89: Hoare triple {233269#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {233269#(<= ~counter~0 10)} is VALID [2022-04-14 16:13:02,928 INFO L290 TraceCheckUtils]: 90: Hoare triple {233269#(<= ~counter~0 10)} assume !(~c~0 >= ~b~0); {233269#(<= ~counter~0 10)} is VALID [2022-04-14 16:13:02,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {233269#(<= ~counter~0 10)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233269#(<= ~counter~0 10)} is VALID [2022-04-14 16:13:02,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {233269#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233282#(<= ~counter~0 11)} is VALID [2022-04-14 16:13:02,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {233282#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {233282#(<= ~counter~0 11)} is VALID [2022-04-14 16:13:02,929 INFO L290 TraceCheckUtils]: 94: Hoare triple {233282#(<= ~counter~0 11)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233282#(<= ~counter~0 11)} is VALID [2022-04-14 16:13:02,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {233282#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233292#(<= ~counter~0 12)} is VALID [2022-04-14 16:13:02,930 INFO L290 TraceCheckUtils]: 96: Hoare triple {233292#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {233292#(<= ~counter~0 12)} is VALID [2022-04-14 16:13:02,930 INFO L290 TraceCheckUtils]: 97: Hoare triple {233292#(<= ~counter~0 12)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233292#(<= ~counter~0 12)} is VALID [2022-04-14 16:13:02,931 INFO L290 TraceCheckUtils]: 98: Hoare triple {233292#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,931 INFO L290 TraceCheckUtils]: 99: Hoare triple {233302#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,931 INFO L272 TraceCheckUtils]: 100: Hoare triple {233302#(<= ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,931 INFO L290 TraceCheckUtils]: 101: Hoare triple {233302#(<= ~counter~0 13)} ~cond := #in~cond; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,932 INFO L290 TraceCheckUtils]: 102: Hoare triple {233302#(<= ~counter~0 13)} assume !(0 == ~cond); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,932 INFO L290 TraceCheckUtils]: 103: Hoare triple {233302#(<= ~counter~0 13)} assume true; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,932 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {233302#(<= ~counter~0 13)} {233302#(<= ~counter~0 13)} #98#return; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,932 INFO L272 TraceCheckUtils]: 105: Hoare triple {233302#(<= ~counter~0 13)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,933 INFO L290 TraceCheckUtils]: 106: Hoare triple {233302#(<= ~counter~0 13)} ~cond := #in~cond; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,933 INFO L290 TraceCheckUtils]: 107: Hoare triple {233302#(<= ~counter~0 13)} assume !(0 == ~cond); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,933 INFO L290 TraceCheckUtils]: 108: Hoare triple {233302#(<= ~counter~0 13)} assume true; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,933 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {233302#(<= ~counter~0 13)} {233302#(<= ~counter~0 13)} #100#return; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,933 INFO L272 TraceCheckUtils]: 110: Hoare triple {233302#(<= ~counter~0 13)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,934 INFO L290 TraceCheckUtils]: 111: Hoare triple {233302#(<= ~counter~0 13)} ~cond := #in~cond; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,934 INFO L290 TraceCheckUtils]: 112: Hoare triple {233302#(<= ~counter~0 13)} assume !(0 == ~cond); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,934 INFO L290 TraceCheckUtils]: 113: Hoare triple {233302#(<= ~counter~0 13)} assume true; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,934 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {233302#(<= ~counter~0 13)} {233302#(<= ~counter~0 13)} #102#return; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,934 INFO L272 TraceCheckUtils]: 115: Hoare triple {233302#(<= ~counter~0 13)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,935 INFO L290 TraceCheckUtils]: 116: Hoare triple {233302#(<= ~counter~0 13)} ~cond := #in~cond; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,935 INFO L290 TraceCheckUtils]: 117: Hoare triple {233302#(<= ~counter~0 13)} assume !(0 == ~cond); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,935 INFO L290 TraceCheckUtils]: 118: Hoare triple {233302#(<= ~counter~0 13)} assume true; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,935 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {233302#(<= ~counter~0 13)} {233302#(<= ~counter~0 13)} #104#return; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,935 INFO L290 TraceCheckUtils]: 120: Hoare triple {233302#(<= ~counter~0 13)} assume !(~c~0 >= 2 * ~v~0); {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,936 INFO L290 TraceCheckUtils]: 121: Hoare triple {233302#(<= ~counter~0 13)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233302#(<= ~counter~0 13)} is VALID [2022-04-14 16:13:02,936 INFO L290 TraceCheckUtils]: 122: Hoare triple {233302#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233375#(<= ~counter~0 14)} is VALID [2022-04-14 16:13:02,936 INFO L290 TraceCheckUtils]: 123: Hoare triple {233375#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {233375#(<= ~counter~0 14)} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 124: Hoare triple {233375#(<= ~counter~0 14)} assume !(~c~0 >= ~b~0); {233375#(<= ~counter~0 14)} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 125: Hoare triple {233375#(<= ~counter~0 14)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233375#(<= ~counter~0 14)} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 126: Hoare triple {233375#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233388#(<= |main_#t~post6| 14)} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 127: Hoare triple {233388#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {232991#false} is VALID [2022-04-14 16:13:02,937 INFO L272 TraceCheckUtils]: 128: Hoare triple {232991#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {232991#false} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 129: Hoare triple {232991#false} ~cond := #in~cond; {232991#false} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 130: Hoare triple {232991#false} assume 0 == ~cond; {232991#false} is VALID [2022-04-14 16:13:02,937 INFO L290 TraceCheckUtils]: 131: Hoare triple {232991#false} assume !false; {232991#false} is VALID [2022-04-14 16:13:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 311 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2022-04-14 16:13:02,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:13:03,400 INFO L290 TraceCheckUtils]: 131: Hoare triple {232991#false} assume !false; {232991#false} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 130: Hoare triple {232991#false} assume 0 == ~cond; {232991#false} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 129: Hoare triple {232991#false} ~cond := #in~cond; {232991#false} is VALID [2022-04-14 16:13:03,401 INFO L272 TraceCheckUtils]: 128: Hoare triple {232991#false} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {232991#false} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 127: Hoare triple {233416#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {232991#false} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 126: Hoare triple {233420#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233416#(< |main_#t~post6| 100)} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 125: Hoare triple {233420#(< ~counter~0 100)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233420#(< ~counter~0 100)} is VALID [2022-04-14 16:13:03,401 INFO L290 TraceCheckUtils]: 124: Hoare triple {233420#(< ~counter~0 100)} assume !(~c~0 >= ~b~0); {233420#(< ~counter~0 100)} is VALID [2022-04-14 16:13:03,402 INFO L290 TraceCheckUtils]: 123: Hoare triple {233420#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {233420#(< ~counter~0 100)} is VALID [2022-04-14 16:13:03,403 INFO L290 TraceCheckUtils]: 122: Hoare triple {233433#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233420#(< ~counter~0 100)} is VALID [2022-04-14 16:13:03,403 INFO L290 TraceCheckUtils]: 121: Hoare triple {233433#(< ~counter~0 99)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,403 INFO L290 TraceCheckUtils]: 120: Hoare triple {233433#(< ~counter~0 99)} assume !(~c~0 >= 2 * ~v~0); {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,404 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {232990#true} {233433#(< ~counter~0 99)} #104#return; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 118: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 117: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 116: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L272 TraceCheckUtils]: 115: Hoare triple {233433#(< ~counter~0 99)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {232990#true} {233433#(< ~counter~0 99)} #102#return; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 113: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 112: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L290 TraceCheckUtils]: 111: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,404 INFO L272 TraceCheckUtils]: 110: Hoare triple {233433#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {232990#true} {233433#(< ~counter~0 99)} #100#return; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 107: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L272 TraceCheckUtils]: 105: Hoare triple {233433#(< ~counter~0 99)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {232990#true} {233433#(< ~counter~0 99)} #98#return; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 103: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,406 INFO L272 TraceCheckUtils]: 100: Hoare triple {233433#(< ~counter~0 99)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,406 INFO L290 TraceCheckUtils]: 99: Hoare triple {233433#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,406 INFO L290 TraceCheckUtils]: 98: Hoare triple {233506#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233433#(< ~counter~0 99)} is VALID [2022-04-14 16:13:03,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {233506#(< ~counter~0 98)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233506#(< ~counter~0 98)} is VALID [2022-04-14 16:13:03,407 INFO L290 TraceCheckUtils]: 96: Hoare triple {233506#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {233506#(< ~counter~0 98)} is VALID [2022-04-14 16:13:03,407 INFO L290 TraceCheckUtils]: 95: Hoare triple {233516#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233506#(< ~counter~0 98)} is VALID [2022-04-14 16:13:03,408 INFO L290 TraceCheckUtils]: 94: Hoare triple {233516#(< ~counter~0 97)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233516#(< ~counter~0 97)} is VALID [2022-04-14 16:13:03,408 INFO L290 TraceCheckUtils]: 93: Hoare triple {233516#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {233516#(< ~counter~0 97)} is VALID [2022-04-14 16:13:03,408 INFO L290 TraceCheckUtils]: 92: Hoare triple {233526#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233516#(< ~counter~0 97)} is VALID [2022-04-14 16:13:03,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {233526#(< ~counter~0 96)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233526#(< ~counter~0 96)} is VALID [2022-04-14 16:13:03,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {233526#(< ~counter~0 96)} assume !(~c~0 >= ~b~0); {233526#(< ~counter~0 96)} is VALID [2022-04-14 16:13:03,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {233526#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {233526#(< ~counter~0 96)} is VALID [2022-04-14 16:13:03,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {233539#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233526#(< ~counter~0 96)} is VALID [2022-04-14 16:13:03,410 INFO L290 TraceCheckUtils]: 87: Hoare triple {233539#(< ~counter~0 95)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,410 INFO L290 TraceCheckUtils]: 86: Hoare triple {233539#(< ~counter~0 95)} assume !(~c~0 >= 2 * ~v~0); {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,410 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {232990#true} {233539#(< ~counter~0 95)} #104#return; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,410 INFO L290 TraceCheckUtils]: 84: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,410 INFO L290 TraceCheckUtils]: 83: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,410 INFO L290 TraceCheckUtils]: 82: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,410 INFO L272 TraceCheckUtils]: 81: Hoare triple {233539#(< ~counter~0 95)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {232990#true} {233539#(< ~counter~0 95)} #102#return; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 79: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 78: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 77: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L272 TraceCheckUtils]: 76: Hoare triple {233539#(< ~counter~0 95)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {232990#true} {233539#(< ~counter~0 95)} #100#return; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 74: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 73: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L290 TraceCheckUtils]: 72: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,411 INFO L272 TraceCheckUtils]: 71: Hoare triple {233539#(< ~counter~0 95)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,412 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {232990#true} {233539#(< ~counter~0 95)} #98#return; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,412 INFO L290 TraceCheckUtils]: 67: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,412 INFO L272 TraceCheckUtils]: 66: Hoare triple {233539#(< ~counter~0 95)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,412 INFO L290 TraceCheckUtils]: 65: Hoare triple {233539#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,413 INFO L290 TraceCheckUtils]: 64: Hoare triple {233612#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233539#(< ~counter~0 95)} is VALID [2022-04-14 16:13:03,413 INFO L290 TraceCheckUtils]: 63: Hoare triple {233612#(< ~counter~0 94)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233612#(< ~counter~0 94)} is VALID [2022-04-14 16:13:03,413 INFO L290 TraceCheckUtils]: 62: Hoare triple {233612#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {233612#(< ~counter~0 94)} is VALID [2022-04-14 16:13:03,414 INFO L290 TraceCheckUtils]: 61: Hoare triple {233622#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233612#(< ~counter~0 94)} is VALID [2022-04-14 16:13:03,414 INFO L290 TraceCheckUtils]: 60: Hoare triple {233622#(< ~counter~0 93)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233622#(< ~counter~0 93)} is VALID [2022-04-14 16:13:03,414 INFO L290 TraceCheckUtils]: 59: Hoare triple {233622#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {233622#(< ~counter~0 93)} is VALID [2022-04-14 16:13:03,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {233632#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233622#(< ~counter~0 93)} is VALID [2022-04-14 16:13:03,415 INFO L290 TraceCheckUtils]: 57: Hoare triple {233632#(< ~counter~0 92)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233632#(< ~counter~0 92)} is VALID [2022-04-14 16:13:03,415 INFO L290 TraceCheckUtils]: 56: Hoare triple {233632#(< ~counter~0 92)} assume !(~c~0 >= ~b~0); {233632#(< ~counter~0 92)} is VALID [2022-04-14 16:13:03,415 INFO L290 TraceCheckUtils]: 55: Hoare triple {233632#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {233632#(< ~counter~0 92)} is VALID [2022-04-14 16:13:03,416 INFO L290 TraceCheckUtils]: 54: Hoare triple {233645#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233632#(< ~counter~0 92)} is VALID [2022-04-14 16:13:03,416 INFO L290 TraceCheckUtils]: 53: Hoare triple {233645#(< ~counter~0 91)} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,416 INFO L290 TraceCheckUtils]: 52: Hoare triple {233645#(< ~counter~0 91)} assume !(~c~0 >= 2 * ~v~0); {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,417 INFO L284 TraceCheckUtils]: 51: Hoare quadruple {232990#true} {233645#(< ~counter~0 91)} #104#return; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 50: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 49: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 48: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L272 TraceCheckUtils]: 47: Hoare triple {233645#(< ~counter~0 91)} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {232990#true} {233645#(< ~counter~0 91)} #102#return; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,417 INFO L272 TraceCheckUtils]: 42: Hoare triple {233645#(< ~counter~0 91)} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {232990#true} {233645#(< ~counter~0 91)} #100#return; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L272 TraceCheckUtils]: 37: Hoare triple {233645#(< ~counter~0 91)} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {232990#true} {233645#(< ~counter~0 91)} #98#return; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 35: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 34: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L290 TraceCheckUtils]: 33: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,418 INFO L272 TraceCheckUtils]: 32: Hoare triple {233645#(< ~counter~0 91)} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,426 INFO L290 TraceCheckUtils]: 31: Hoare triple {233645#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {233718#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {233645#(< ~counter~0 91)} is VALID [2022-04-14 16:13:03,428 INFO L290 TraceCheckUtils]: 29: Hoare triple {233718#(< ~counter~0 90)} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {233718#(< ~counter~0 90)} is VALID [2022-04-14 16:13:03,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {233718#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {233718#(< ~counter~0 90)} is VALID [2022-04-14 16:13:03,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {233728#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233718#(< ~counter~0 90)} is VALID [2022-04-14 16:13:03,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {233728#(< ~counter~0 89)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233728#(< ~counter~0 89)} is VALID [2022-04-14 16:13:03,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {233728#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {233728#(< ~counter~0 89)} is VALID [2022-04-14 16:13:03,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {233738#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233728#(< ~counter~0 89)} is VALID [2022-04-14 16:13:03,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {233738#(< ~counter~0 88)} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {233738#(< ~counter~0 88)} is VALID [2022-04-14 16:13:03,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {233738#(< ~counter~0 88)} assume !(~c~0 >= ~b~0); {233738#(< ~counter~0 88)} is VALID [2022-04-14 16:13:03,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {233738#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {233738#(< ~counter~0 88)} is VALID [2022-04-14 16:13:03,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {233751#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {233738#(< ~counter~0 88)} is VALID [2022-04-14 16:13:03,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {233751#(< ~counter~0 87)} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {233751#(< ~counter~0 87)} is VALID [2022-04-14 16:13:03,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {233751#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {233751#(< ~counter~0 87)} is VALID [2022-04-14 16:13:03,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {233761#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {233751#(< ~counter~0 87)} is VALID [2022-04-14 16:13:03,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {233761#(< ~counter~0 86)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,434 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {232990#true} {233761#(< ~counter~0 86)} #96#return; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,434 INFO L272 TraceCheckUtils]: 11: Hoare triple {233761#(< ~counter~0 86)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {232990#true} {233761#(< ~counter~0 86)} #94#return; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {232990#true} assume true; {232990#true} is VALID [2022-04-14 16:13:03,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {232990#true} assume !(0 == ~cond); {232990#true} is VALID [2022-04-14 16:13:03,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {232990#true} ~cond := #in~cond; {232990#true} is VALID [2022-04-14 16:13:03,435 INFO L272 TraceCheckUtils]: 6: Hoare triple {233761#(< ~counter~0 86)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {232990#true} is VALID [2022-04-14 16:13:03,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {233761#(< ~counter~0 86)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {233761#(< ~counter~0 86)} call #t~ret9 := main(); {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {233761#(< ~counter~0 86)} {232990#true} #108#return; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {233761#(< ~counter~0 86)} assume true; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {232990#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {233761#(< ~counter~0 86)} is VALID [2022-04-14 16:13:03,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {232990#true} call ULTIMATE.init(); {232990#true} is VALID [2022-04-14 16:13:03,437 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 24 proven. 119 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-14 16:13:03,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:13:03,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191693185] [2022-04-14 16:13:03,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:13:03,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027577543] [2022-04-14 16:13:03,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027577543] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 16:13:03,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 16:13:03,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-14 16:13:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055581678] [2022-04-14 16:13:03,437 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 16:13:03,438 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2022-04-14 16:13:03,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:13:03,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-14 16:13:03,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:13:03,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-14 16:13:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:13:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-14 16:13:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-14 16:13:03,613 INFO L87 Difference]: Start difference. First operand 6950 states and 9637 transitions. Second operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-14 16:13:34,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:13:34,871 INFO L93 Difference]: Finished difference Result 12791 states and 18497 transitions. [2022-04-14 16:13:34,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-14 16:13:34,871 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) Word has length 132 [2022-04-14 16:13:34,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:13:34,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-14 16:13:34,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 809 transitions. [2022-04-14 16:13:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-14 16:13:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 809 transitions. [2022-04-14 16:13:34,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 809 transitions. [2022-04-14 16:13:35,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 809 edges. 809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:13:43,020 INFO L225 Difference]: With dead ends: 12791 [2022-04-14 16:13:43,020 INFO L226 Difference]: Without dead ends: 12786 [2022-04-14 16:13:43,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1327, Invalid=2333, Unknown=0, NotChecked=0, Total=3660 [2022-04-14 16:13:43,024 INFO L913 BasicCegarLoop]: 149 mSDtfsCounter, 1096 mSDsluCounter, 802 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 650 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1096 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 650 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-14 16:13:43,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1096 Valid, 951 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [650 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-14 16:13:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12786 states. [2022-04-14 16:14:06,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12786 to 12279. [2022-04-14 16:14:06,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:14:06,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12786 states. Second operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) [2022-04-14 16:14:06,222 INFO L74 IsIncluded]: Start isIncluded. First operand 12786 states. Second operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) [2022-04-14 16:14:06,234 INFO L87 Difference]: Start difference. First operand 12786 states. Second operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) [2022-04-14 16:14:11,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:11,181 INFO L93 Difference]: Finished difference Result 12786 states and 18216 transitions. [2022-04-14 16:14:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 12786 states and 18216 transitions. [2022-04-14 16:14:11,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:11,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:11,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) Second operand 12786 states. [2022-04-14 16:14:11,224 INFO L87 Difference]: Start difference. First operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) Second operand 12786 states. [2022-04-14 16:14:15,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:14:15,992 INFO L93 Difference]: Finished difference Result 12786 states and 18216 transitions. [2022-04-14 16:14:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12786 states and 18216 transitions. [2022-04-14 16:14:16,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:14:16,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:14:16,009 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:14:16,009 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:14:16,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12279 states, 8094 states have (on average 1.2834198171485052) internal successors, (10388), 8192 states have internal predecessors, (10388), 3628 states have call successors, (3628), 558 states have call predecessors, (3628), 556 states have return successors, (3626), 3528 states have call predecessors, (3626), 3626 states have call successors, (3626) [2022-04-14 16:14:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12279 states to 12279 states and 17642 transitions. [2022-04-14 16:14:22,203 INFO L78 Accepts]: Start accepts. Automaton has 12279 states and 17642 transitions. Word has length 132 [2022-04-14 16:14:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:14:22,203 INFO L478 AbstractCegarLoop]: Abstraction has 12279 states and 17642 transitions. [2022-04-14 16:14:22,203 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 3.8529411764705883) internal successors, (131), 34 states have internal predecessors, (131), 10 states have call successors, (32), 7 states have call predecessors, (32), 6 states have return successors, (30), 8 states have call predecessors, (30), 9 states have call successors, (30) [2022-04-14 16:14:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 12279 states and 17642 transitions. [2022-04-14 16:14:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-14 16:14:22,205 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:14:22,205 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:14:22,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-14 16:14:22,420 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-14 16:14:22,421 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:14:22,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:14:22,421 INFO L85 PathProgramCache]: Analyzing trace with hash -213306419, now seen corresponding path program 3 times [2022-04-14 16:14:22,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:14:22,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945860028] [2022-04-14 16:14:22,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:14:22,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:14:22,449 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:14:22,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [640425100] [2022-04-14 16:14:22,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-14 16:14:22,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:14:22,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:14:22,451 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 16:14:22,452 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-14 16:14:22,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-04-14 16:14:22,584 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 16:14:22,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 76 conjunts are in the unsatisfiable core [2022-04-14 16:14:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:14:22,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:15:06,310 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 16:15:06,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {296961#true} call ULTIMATE.init(); {296961#true} is VALID [2022-04-14 16:15:06,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {296961#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {296961#true} is VALID [2022-04-14 16:15:06,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {296961#true} {296961#true} #108#return; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {296961#true} call #t~ret9 := main(); {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {296961#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L272 TraceCheckUtils]: 6: Hoare triple {296961#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {296961#true} {296961#true} #94#return; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L272 TraceCheckUtils]: 11: Hoare triple {296961#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,910 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {296961#true} {296961#true} #96#return; {296961#true} is VALID [2022-04-14 16:15:06,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {296961#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1; {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,911 INFO L290 TraceCheckUtils]: 17: Hoare triple {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,911 INFO L290 TraceCheckUtils]: 18: Hoare triple {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {297014#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {297024#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,914 INFO L272 TraceCheckUtils]: 25: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,915 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {296961#true} {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #98#return; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,915 INFO L272 TraceCheckUtils]: 30: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,916 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {296961#true} {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #100#return; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,916 INFO L290 TraceCheckUtils]: 36: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,916 INFO L290 TraceCheckUtils]: 38: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {296961#true} {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #102#return; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,917 INFO L272 TraceCheckUtils]: 40: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,917 INFO L290 TraceCheckUtils]: 41: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,917 INFO L290 TraceCheckUtils]: 42: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,918 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {296961#true} {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} #104#return; {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,918 INFO L290 TraceCheckUtils]: 45: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} assume !(~c~0 >= 2 * ~v~0); {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,919 INFO L290 TraceCheckUtils]: 46: Hoare triple {297034#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,919 INFO L290 TraceCheckUtils]: 47: Hoare triple {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,919 INFO L290 TraceCheckUtils]: 48: Hoare triple {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,920 INFO L290 TraceCheckUtils]: 49: Hoare triple {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} assume !(~c~0 >= ~b~0); {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,920 INFO L290 TraceCheckUtils]: 50: Hoare triple {297107#(and (= main_~r~0 0) (= main_~s~0 1) (= (+ main_~x~0 (* (- 1) main_~b~0)) main_~c~0) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,922 INFO L290 TraceCheckUtils]: 53: Hoare triple {297120#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0) (= main_~b~0 (+ (* (- 1) main_~a~0) main_~x~0)) (= main_~q~0 1))} assume !!(0 != ~b~0);havoc ~c~0;havoc ~k~0;~c~0 := ~a~0;~k~0 := 0; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,922 INFO L290 TraceCheckUtils]: 54: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,923 INFO L290 TraceCheckUtils]: 55: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,923 INFO L290 TraceCheckUtils]: 56: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(~c~0 >= ~b~0);havoc ~d~0;havoc ~v~0;~d~0 := 1;~v~0 := ~b~0; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,923 INFO L290 TraceCheckUtils]: 57: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,924 INFO L272 TraceCheckUtils]: 59: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,924 INFO L290 TraceCheckUtils]: 62: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,925 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #98#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,925 INFO L272 TraceCheckUtils]: 64: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,926 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #100#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,926 INFO L272 TraceCheckUtils]: 69: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,926 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #102#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,927 INFO L272 TraceCheckUtils]: 74: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,927 INFO L284 TraceCheckUtils]: 78: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #104#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,928 INFO L290 TraceCheckUtils]: 79: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,928 INFO L290 TraceCheckUtils]: 80: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,929 INFO L290 TraceCheckUtils]: 81: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,929 INFO L272 TraceCheckUtils]: 82: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,929 INFO L290 TraceCheckUtils]: 83: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,929 INFO L290 TraceCheckUtils]: 84: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,929 INFO L290 TraceCheckUtils]: 85: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,930 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #98#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,930 INFO L272 TraceCheckUtils]: 87: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,930 INFO L290 TraceCheckUtils]: 89: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,930 INFO L290 TraceCheckUtils]: 90: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,930 INFO L284 TraceCheckUtils]: 91: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #100#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,931 INFO L272 TraceCheckUtils]: 92: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,931 INFO L290 TraceCheckUtils]: 93: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,931 INFO L290 TraceCheckUtils]: 94: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,931 INFO L290 TraceCheckUtils]: 95: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,931 INFO L284 TraceCheckUtils]: 96: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #102#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,931 INFO L272 TraceCheckUtils]: 97: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,932 INFO L290 TraceCheckUtils]: 98: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,932 INFO L290 TraceCheckUtils]: 99: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,932 INFO L290 TraceCheckUtils]: 100: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,932 INFO L284 TraceCheckUtils]: 101: Hoare quadruple {296961#true} {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #104#return; {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,934 INFO L290 TraceCheckUtils]: 102: Hoare triple {297130#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(~c~0 >= 2 * ~v~0);~d~0 := 2 * ~d~0;~v~0 := 2 * ~v~0; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,934 INFO L290 TraceCheckUtils]: 103: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,935 INFO L290 TraceCheckUtils]: 104: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,935 INFO L272 TraceCheckUtils]: 105: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~y~0 * ~r~0 + ~x~0 * ~p~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,935 INFO L290 TraceCheckUtils]: 106: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,935 INFO L290 TraceCheckUtils]: 107: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,935 INFO L290 TraceCheckUtils]: 108: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,936 INFO L284 TraceCheckUtils]: 109: Hoare quadruple {296961#true} {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #98#return; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,936 INFO L272 TraceCheckUtils]: 110: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~b~0 == ~x~0 * ~q~0 + ~y~0 * ~s~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,936 INFO L290 TraceCheckUtils]: 111: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,936 INFO L290 TraceCheckUtils]: 112: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,936 INFO L290 TraceCheckUtils]: 113: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,937 INFO L284 TraceCheckUtils]: 114: Hoare quadruple {296961#true} {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #100#return; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,937 INFO L272 TraceCheckUtils]: 115: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,937 INFO L290 TraceCheckUtils]: 116: Hoare triple {296961#true} ~cond := #in~cond; {296961#true} is VALID [2022-04-14 16:15:06,937 INFO L290 TraceCheckUtils]: 117: Hoare triple {296961#true} assume !(0 == ~cond); {296961#true} is VALID [2022-04-14 16:15:06,937 INFO L290 TraceCheckUtils]: 118: Hoare triple {296961#true} assume true; {296961#true} is VALID [2022-04-14 16:15:06,938 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {296961#true} {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #102#return; {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,938 INFO L272 TraceCheckUtils]: 120: Hoare triple {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} call __VERIFIER_assert((if ~v~0 == ~b~0 * ~d~0 then 1 else 0)); {296961#true} is VALID [2022-04-14 16:15:06,938 INFO L290 TraceCheckUtils]: 121: Hoare triple {296961#true} ~cond := #in~cond; {297336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:15:06,938 INFO L290 TraceCheckUtils]: 122: Hoare triple {297336#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {297340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:06,938 INFO L290 TraceCheckUtils]: 123: Hoare triple {297340#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {297340#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 16:15:06,939 INFO L284 TraceCheckUtils]: 124: Hoare quadruple {297340#(not (= |__VERIFIER_assert_#in~cond| 0))} {297278#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} #104#return; {297347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,940 INFO L290 TraceCheckUtils]: 125: Hoare triple {297347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} assume !(~c~0 >= 2 * ~v~0); {297347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} is VALID [2022-04-14 16:15:06,943 INFO L290 TraceCheckUtils]: 126: Hoare triple {297347#(and (= main_~v~0 (* main_~d~0 main_~b~0)) (= (+ main_~s~0 main_~r~0) 0) (= main_~p~0 0) (= main_~k~0 0) (= main_~c~0 main_~y~0) (= main_~r~0 1) (= (mod main_~d~0 2) 0) (= main_~q~0 1) (= main_~b~0 (+ (* (- 1) main_~c~0) main_~x~0)))} ~c~0 := ~c~0 - ~v~0;~k~0 := ~k~0 + ~d~0; {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,943 INFO L290 TraceCheckUtils]: 127: Hoare triple {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,944 INFO L290 TraceCheckUtils]: 128: Hoare triple {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,944 INFO L290 TraceCheckUtils]: 129: Hoare triple {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} assume !(~c~0 >= ~b~0); {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} is VALID [2022-04-14 16:15:06,981 INFO L290 TraceCheckUtils]: 130: Hoare triple {297354#(and (= (+ main_~s~0 main_~r~0) 0) (= main_~y~0 (+ main_~c~0 (* main_~b~0 main_~k~0))) (= main_~p~0 0) (= (+ (* (- 1) (* main_~b~0 main_~k~0)) (* (- 1) main_~c~0) main_~x~0) main_~b~0) (= main_~r~0 1) (= (mod main_~k~0 2) 0) (= main_~q~0 1))} ~a~0 := ~b~0;~b~0 := ~c~0;havoc ~temp~0;~temp~0 := ~p~0;~p~0 := ~q~0;~q~0 := ~temp~0 - ~q~0 * ~k~0;~temp~0 := ~r~0;~r~0 := ~s~0;~s~0 := ~temp~0 - ~s~0 * ~k~0; {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,982 INFO L290 TraceCheckUtils]: 131: Hoare triple {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,982 INFO L290 TraceCheckUtils]: 132: Hoare triple {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} is VALID [2022-04-14 16:15:06,983 INFO L290 TraceCheckUtils]: 133: Hoare triple {297367#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= main_~y~0 (+ main_~b~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0))))) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~p~0 1))} assume !(0 != ~b~0); {297377#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~y~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) (= main_~p~0 1))} is VALID [2022-04-14 16:15:08,986 WARN L272 TraceCheckUtils]: 134: Hoare triple {297377#(and (= (+ main_~a~0 main_~y~0) main_~x~0) (= (+ main_~r~0 1) 0) (= 0 (mod (+ main_~s~0 main_~r~0) 2)) (= (+ main_~q~0 (* 2 (* main_~p~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) 0) (= main_~y~0 (* 2 (* main_~a~0 (div (div (+ (* (- 1) main_~s~0) (* (- 1) main_~r~0)) 2) main_~r~0)))) (= main_~p~0 1))} call __VERIFIER_assert((if ~p~0 * ~x~0 - ~q~0 * ~x~0 + ~r~0 * ~y~0 - ~s~0 * ~y~0 == ~a~0 then 1 else 0)); {297381#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-14 16:15:08,986 INFO L290 TraceCheckUtils]: 135: Hoare triple {297381#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {297385#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:15:08,986 INFO L290 TraceCheckUtils]: 136: Hoare triple {297385#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296962#false} is VALID [2022-04-14 16:15:08,987 INFO L290 TraceCheckUtils]: 137: Hoare triple {296962#false} assume !false; {296962#false} is VALID [2022-04-14 16:15:08,987 INFO L134 CoverageAnalysis]: Checked inductivity of 587 backedges. 90 proven. 51 refuted. 0 times theorem prover too weak. 446 trivial. 0 not checked. [2022-04-14 16:15:08,987 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 16:15:34,125 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-14 16:15:41,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:15:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945860028] [2022-04-14 16:15:41,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:15:41,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640425100] [2022-04-14 16:15:41,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640425100] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-14 16:15:41,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-14 16:15:41,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2022-04-14 16:15:41,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018462153] [2022-04-14 16:15:41,070 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-14 16:15:41,070 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) Word has length 138 [2022-04-14 16:15:41,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:15:41,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-14 16:15:45,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 16:15:45,682 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-14 16:15:45,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:15:45,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-14 16:15:45,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=466, Unknown=5, NotChecked=0, Total=552 [2022-04-14 16:15:45,683 INFO L87 Difference]: Start difference. First operand 12279 states and 17642 transitions. Second operand has 17 states, 16 states have (on average 3.1875) internal successors, (51), 16 states have internal predecessors, (51), 5 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 5 states have call predecessors, (15), 4 states have call successors, (15) [2022-04-14 16:15:57,243 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 []