/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 07:33:25,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 07:33:25,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 07:33:25,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 07:33:25,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 07:33:25,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 07:33:25,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 07:33:25,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 07:33:25,239 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 07:33:25,243 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 07:33:25,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 07:33:25,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 07:33:25,246 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 07:33:25,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 07:33:25,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 07:33:25,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 07:33:25,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 07:33:25,253 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 07:33:25,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 07:33:25,258 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 07:33:25,259 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 07:33:25,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 07:33:25,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 07:33:25,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 07:33:25,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 07:33:25,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 07:33:25,271 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 07:33:25,271 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 07:33:25,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 07:33:25,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 07:33:25,272 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 07:33:25,273 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 07:33:25,273 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 07:33:25,274 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 07:33:25,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 07:33:25,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 07:33:25,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 07:33:25,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 07:33:25,276 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 07:33:25,276 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 07:33:25,277 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 07:33:25,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 07:33:25,282 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 07:33:25,291 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 07:33:25,291 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 07:33:25,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 07:33:25,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 07:33:25,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 07:33:25,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 07:33:25,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 07:33:25,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 07:33:25,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 07:33:25,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 07:33:25,294 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:33:25,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 07:33:25,295 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 07:33:25,531 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 07:33:25,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 07:33:25,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 07:33:25,559 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 07:33:25,560 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 07:33:25,560 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-08 07:33:25,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8363b8103/324514e65cae4f97aed5c99480520a02/FLAG67ae75bf0 [2022-04-08 07:33:26,021 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 07:33:26,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prodbin-ll_valuebound100.c [2022-04-08 07:33:26,029 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8363b8103/324514e65cae4f97aed5c99480520a02/FLAG67ae75bf0 [2022-04-08 07:33:26,041 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8363b8103/324514e65cae4f97aed5c99480520a02 [2022-04-08 07:33:26,043 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 07:33:26,045 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 07:33:26,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 07:33:26,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 07:33:26,051 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 07:33:26,052 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,053 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3091af6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26, skipping insertion in model container [2022-04-08 07:33:26,053 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 07:33:26,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 07:33:26,217 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/prodbin-ll_valuebound100.c[537,550] [2022-04-08 07:33:26,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:33:26,235 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 07:33:26,246 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/prodbin-ll_valuebound100.c[537,550] [2022-04-08 07:33:26,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 07:33:26,260 INFO L208 MainTranslator]: Completed translation [2022-04-08 07:33:26,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26 WrapperNode [2022-04-08 07:33:26,260 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 07:33:26,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 07:33:26,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 07:33:26,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 07:33:26,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,274 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,274 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,282 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,283 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 07:33:26,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 07:33:26,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 07:33:26,285 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 07:33:26,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (1/1) ... [2022-04-08 07:33:26,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 07:33:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:33:26,316 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-08 07:33:26,324 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-08 07:33:26,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 07:33:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 07:33:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 07:33:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 07:33:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 07:33:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 07:33:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 07:33:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 07:33:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 07:33:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 07:33:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 07:33:26,351 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 07:33:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 07:33:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 07:33:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 07:33:26,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 07:33:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 07:33:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 07:33:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 07:33:26,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 07:33:26,408 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 07:33:26,409 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 07:33:26,578 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 07:33:26,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 07:33:26,584 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 07:33:26,586 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:33:26 BoogieIcfgContainer [2022-04-08 07:33:26,586 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 07:33:26,587 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 07:33:26,587 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 07:33:26,590 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 07:33:26,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 07:33:26" (1/3) ... [2022-04-08 07:33:26,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702039ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:33:26, skipping insertion in model container [2022-04-08 07:33:26,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 07:33:26" (2/3) ... [2022-04-08 07:33:26,592 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@702039ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 07:33:26, skipping insertion in model container [2022-04-08 07:33:26,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 07:33:26" (3/3) ... [2022-04-08 07:33:26,593 INFO L111 eAbstractionObserver]: Analyzing ICFG prodbin-ll_valuebound100.c [2022-04-08 07:33:26,597 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 07:33:26,597 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 07:33:26,670 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 07:33:26,675 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-08 07:33:26,675 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 07:33:26,707 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:33:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:33:26,714 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:33:26,714 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:33:26,715 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:33:26,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:33:26,719 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 1 times [2022-04-08 07:33:26,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:26,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1182944513] [2022-04-08 07:33:26,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:33:26,752 INFO L85 PathProgramCache]: Analyzing trace with hash -589322634, now seen corresponding path program 2 times [2022-04-08 07:33:26,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:33:26,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264412846] [2022-04-08 07:33:26,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:33:26,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:33:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 07:33:26,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:26,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 07:33:26,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 07:33:26,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-08 07:33:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 07:33:26,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:26,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:26,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:26,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:26,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 07:33:26,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 07:33:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:27,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:27,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:27,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:27,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 07:33:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 07:33:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:27,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:27,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:27,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:27,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 07:33:27,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 07:33:27,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {52#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3); {35#true} is VALID [2022-04-08 07:33:27,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 07:33:27,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #71#return; {35#true} is VALID [2022-04-08 07:33:27,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret6 := main(); {35#true} is VALID [2022-04-08 07:33:27,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-08 07:33:27,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 07:33:27,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:27,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:27,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:27,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #61#return; {36#false} is VALID [2022-04-08 07:33:27,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {36#false} is VALID [2022-04-08 07:33:27,020 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {35#true} is VALID [2022-04-08 07:33:27,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:27,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:27,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:27,021 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} #63#return; {36#false} is VALID [2022-04-08 07:33:27,021 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 07:33:27,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 07:33:27,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 07:33:27,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 07:33:27,022 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} #65#return; {36#false} is VALID [2022-04-08 07:33:27,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {36#false} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {36#false} is VALID [2022-04-08 07:33:27,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {36#false} assume false; {36#false} is VALID [2022-04-08 07:33:27,023 INFO L272 TraceCheckUtils]: 24: Hoare triple {36#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {36#false} is VALID [2022-04-08 07:33:27,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 07:33:27,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 07:33:27,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 07:33:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:33:27,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:33:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264412846] [2022-04-08 07:33:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264412846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:27,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:27,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:33:27,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:33:27,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1182944513] [2022-04-08 07:33:27,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1182944513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:27,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:27,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 07:33:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650727181] [2022-04-08 07:33:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:33:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 07:33:27,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:33:27,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:33:27,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:27,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 07:33:27,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:27,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 07:33:27,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 07:33:27,112 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:33:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:27,267 INFO L93 Difference]: Finished difference Result 57 states and 77 transitions. [2022-04-08 07:33:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 07:33:27,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-08 07:33:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:33:27,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:33:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 07:33:27,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:33:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 07:33:27,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-08 07:33:27,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:27,397 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:33:27,397 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 07:33:27,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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-08 07:33:27,404 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:33:27,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:33:27,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 07:33:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 07:33:27,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:33:27,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:33:27,449 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:33:27,450 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:33:27,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:27,454 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 07:33:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 07:33:27,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:27,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-08 07:33:27,456 INFO L87 Difference]: Start difference. First operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 27 states. [2022-04-08 07:33:27,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:27,463 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 07:33:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 07:33:27,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:27,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:27,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:33:27,464 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:33:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 07:33:27,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 07:33:27,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 28 [2022-04-08 07:33:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:33:27,497 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 07:33:27,497 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 07:33:27,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 07:33:27,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:27,533 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 07:33:27,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 07:33:27,534 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:33:27,534 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:33:27,534 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 07:33:27,535 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:33:27,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:33:27,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 1 times [2022-04-08 07:33:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:27,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1686422689] [2022-04-08 07:33:27,536 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:33:27,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1736242504, now seen corresponding path program 2 times [2022-04-08 07:33:27,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:33:27,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122871099] [2022-04-08 07:33:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:33:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:33:27,560 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:33:27,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [400732171] [2022-04-08 07:33:27,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:33:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:33:27,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:33:27,567 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-08 07:33:27,574 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-08 07:33:27,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 07:33:27,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:33:27,625 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 07:33:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:27,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:33:27,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {277#true} call ULTIMATE.init(); {277#true} is VALID [2022-04-08 07:33:27,853 INFO L290 TraceCheckUtils]: 1: Hoare triple {277#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(13, 2);call #Ultimate.allocInit(12, 3); {277#true} is VALID [2022-04-08 07:33:27,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 07:33:27,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#true} {277#true} #71#return; {277#true} is VALID [2022-04-08 07:33:27,855 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#true} call #t~ret6 := main(); {277#true} is VALID [2022-04-08 07:33:27,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {277#true} is VALID [2022-04-08 07:33:27,858 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {277#true} is VALID [2022-04-08 07:33:27,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 07:33:27,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 07:33:27,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 07:33:27,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#true} {277#true} #61#return; {277#true} is VALID [2022-04-08 07:33:27,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {277#true} is VALID [2022-04-08 07:33:27,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {277#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {277#true} is VALID [2022-04-08 07:33:27,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 07:33:27,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 07:33:27,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 07:33:27,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {277#true} {277#true} #63#return; {277#true} is VALID [2022-04-08 07:33:27,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {277#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {277#true} is VALID [2022-04-08 07:33:27,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {277#true} ~cond := #in~cond; {277#true} is VALID [2022-04-08 07:33:27,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {277#true} assume !(0 == ~cond); {277#true} is VALID [2022-04-08 07:33:27,867 INFO L290 TraceCheckUtils]: 20: Hoare triple {277#true} assume true; {277#true} is VALID [2022-04-08 07:33:27,867 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {277#true} {277#true} #65#return; {277#true} is VALID [2022-04-08 07:33:27,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {277#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:27,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:27,870 INFO L272 TraceCheckUtils]: 24: Hoare triple {348#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {355#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:33:27,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {355#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {359#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:33:27,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {359#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {278#false} is VALID [2022-04-08 07:33:27,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {278#false} assume !false; {278#false} is VALID [2022-04-08 07:33:27,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:33:27,872 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:33:27,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:33:27,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122871099] [2022-04-08 07:33:27,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:33:27,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400732171] [2022-04-08 07:33:27,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400732171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:27,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:27,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:33:27,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:33:27,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1686422689] [2022-04-08 07:33:27,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1686422689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:27,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:27,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 07:33:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901663349] [2022-04-08 07:33:27,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:33:27,879 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 07:33:27,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:33:27,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:33:27,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:27,901 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 07:33:27,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:27,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 07:33:27,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 07:33:27,903 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:33:28,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:28,108 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-04-08 07:33:28,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 07:33:28,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-08 07:33:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:33:28,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:33:28,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 07:33:28,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:33:28,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2022-04-08 07:33:28,121 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2022-04-08 07:33:28,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:28,168 INFO L225 Difference]: With dead ends: 39 [2022-04-08 07:33:28,169 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 07:33:28,175 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-08 07:33:28,177 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 8 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 07:33:28,180 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 07:33:28,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 07:33:28,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-04-08 07:33:28,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:33:28,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:28,199 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:28,200 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:28,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:28,204 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 07:33:28,204 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 07:33:28,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:28,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:28,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:33:28,208 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Second operand 37 states. [2022-04-08 07:33:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:28,216 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-08 07:33:28,216 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-08 07:33:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:28,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:28,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:33:28,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:33:28,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.15) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:28,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-04-08 07:33:28,224 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2022-04-08 07:33:28,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:33:28,224 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-04-08 07:33:28,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 07:33:28,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 37 transitions. [2022-04-08 07:33:28,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-04-08 07:33:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-08 07:33:28,272 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:33:28,273 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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-08 07:33:28,290 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-08 07:33:28,475 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-08 07:33:28,476 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:33:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:33:28,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 1 times [2022-04-08 07:33:28,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:28,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1668631209] [2022-04-08 07:33:28,477 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:33:28,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1911690432, now seen corresponding path program 2 times [2022-04-08 07:33:28,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:33:28,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921979080] [2022-04-08 07:33:28,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:33:28,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:33:28,500 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:33:28,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1230993059] [2022-04-08 07:33:28,501 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:33:28,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:33:28,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:33:28,502 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-08 07:33:28,507 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-08 07:33:28,555 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:33:28,555 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:33:28,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 07:33:28,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:28,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:33:28,690 INFO L272 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2022-04-08 07:33:28,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {585#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(13, 2);call #Ultimate.allocInit(12, 3); {585#true} is VALID [2022-04-08 07:33:28,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 07:33:28,690 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #71#return; {585#true} is VALID [2022-04-08 07:33:28,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret6 := main(); {585#true} is VALID [2022-04-08 07:33:28,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {585#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {585#true} is VALID [2022-04-08 07:33:28,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {585#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {585#true} is VALID [2022-04-08 07:33:28,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 07:33:28,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 07:33:28,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 07:33:28,692 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {585#true} {585#true} #61#return; {585#true} is VALID [2022-04-08 07:33:28,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {585#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {585#true} is VALID [2022-04-08 07:33:28,692 INFO L272 TraceCheckUtils]: 12: Hoare triple {585#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {585#true} is VALID [2022-04-08 07:33:28,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 07:33:28,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 07:33:28,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 07:33:28,692 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {585#true} {585#true} #63#return; {585#true} is VALID [2022-04-08 07:33:28,693 INFO L272 TraceCheckUtils]: 17: Hoare triple {585#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {585#true} is VALID [2022-04-08 07:33:28,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {585#true} ~cond := #in~cond; {644#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:33:28,694 INFO L290 TraceCheckUtils]: 19: Hoare triple {644#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {648#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:33:28,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {648#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {648#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:33:28,695 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {648#(not (= |assume_abort_if_not_#in~cond| 0))} {585#true} #65#return; {655#(<= 1 main_~b~0)} is VALID [2022-04-08 07:33:28,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {655#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {659#(<= 1 main_~y~0)} is VALID [2022-04-08 07:33:28,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {659#(<= 1 main_~y~0)} assume !false; {659#(<= 1 main_~y~0)} is VALID [2022-04-08 07:33:28,696 INFO L272 TraceCheckUtils]: 24: Hoare triple {659#(<= 1 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {585#true} is VALID [2022-04-08 07:33:28,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#true} ~cond := #in~cond; {585#true} is VALID [2022-04-08 07:33:28,697 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#true} assume !(0 == ~cond); {585#true} is VALID [2022-04-08 07:33:28,697 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#true} assume true; {585#true} is VALID [2022-04-08 07:33:28,698 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {585#true} {659#(<= 1 main_~y~0)} #67#return; {659#(<= 1 main_~y~0)} is VALID [2022-04-08 07:33:28,698 INFO L290 TraceCheckUtils]: 29: Hoare triple {659#(<= 1 main_~y~0)} assume !(0 != ~y~0); {586#false} is VALID [2022-04-08 07:33:28,698 INFO L272 TraceCheckUtils]: 30: Hoare triple {586#false} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {586#false} is VALID [2022-04-08 07:33:28,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2022-04-08 07:33:28,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2022-04-08 07:33:28,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {586#false} assume !false; {586#false} is VALID [2022-04-08 07:33:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:33:28,699 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 07:33:28,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:33:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921979080] [2022-04-08 07:33:28,700 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:33:28,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1230993059] [2022-04-08 07:33:28,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1230993059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:28,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:28,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:33:28,701 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:33:28,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1668631209] [2022-04-08 07:33:28,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1668631209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:33:28,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:33:28,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 07:33:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042234397] [2022-04-08 07:33:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:33:28,702 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 07:33:28,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:33:28,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:33:28,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:28,726 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 07:33:28,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:28,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 07:33:28,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 07:33:28,727 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:33:28,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:28,957 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-04-08 07:33:28,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 07:33:28,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-08 07:33:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:33:28,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:33:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 07:33:28,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:33:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 07:33:28,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-08 07:33:29,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:33:29,012 INFO L225 Difference]: With dead ends: 43 [2022-04-08 07:33:29,012 INFO L226 Difference]: Without dead ends: 36 [2022-04-08 07:33:29,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 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-08 07:33:29,019 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:33:29,019 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 07:33:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-08 07:33:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2022-04-08 07:33:29,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:33:29,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:29,045 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:29,045 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:29,048 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:33:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 07:33:29,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:29,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:29,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-08 07:33:29,051 INFO L87 Difference]: Start difference. First operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 36 states. [2022-04-08 07:33:29,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:33:29,057 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2022-04-08 07:33:29,057 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-04-08 07:33:29,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:33:29,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:33:29,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:33:29,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:33:29,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 07:33:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-08 07:33:29,060 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 34 [2022-04-08 07:33:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:33:29,061 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-08 07:33:29,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:33:29,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-08 07:33:29,098 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-08 07:33:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-08 07:33:29,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:33:29,100 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:33:29,100 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-08 07:33:29,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-08 07:33:29,323 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-08 07:33:29,324 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:33:29,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:33:29,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 1 times [2022-04-08 07:33:29,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:33:29,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [756261667] [2022-04-08 07:33:29,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:33:29,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2022075506, now seen corresponding path program 2 times [2022-04-08 07:33:29,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:33:29,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613521948] [2022-04-08 07:33:29,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:33:29,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:33:29,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:33:29,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [558981678] [2022-04-08 07:33:29,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:33:29,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:33:29,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:33:29,348 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-08 07:33:29,350 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-08 07:33:29,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:33:29,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:33:29,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 07:33:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:33:29,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:33:31,769 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-08 07:33:31,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#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(13, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-08 07:33:31,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:33:31,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-08 07:33:31,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-08 07:33:31,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {922#true} is VALID [2022-04-08 07:33:31,770 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 07:33:31,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:33:31,770 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:33:31,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:33:31,771 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-08 07:33:31,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {922#true} is VALID [2022-04-08 07:33:31,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 07:33:31,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:33:31,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:33:31,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:33:31,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-08 07:33:31,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {922#true} is VALID [2022-04-08 07:33:31,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:33:31,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:33:31,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:33:31,772 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-08 07:33:31,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:31,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:31,773 INFO L272 TraceCheckUtils]: 24: Hoare triple {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {922#true} is VALID [2022-04-08 07:33:31,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {1003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:33:31,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {1003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:33:31,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:33:31,776 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} {993#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {1014#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:31,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {1014#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1018#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:33:31,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {1018#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1022#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:33:31,781 INFO L290 TraceCheckUtils]: 31: Hoare triple {1022#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= main_~b~0 (+ main_~y~0 1)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~a~0 main_~x~0) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:33:31,782 INFO L290 TraceCheckUtils]: 32: Hoare triple {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:33:32,549 INFO L272 TraceCheckUtils]: 33: Hoare triple {1026#(and (<= 1 (mod main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* main_~a~0 (+ (- 1) main_~b~0)))) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:33:32,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:33:32,550 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-08 07:33:32,550 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-08 07:33:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:33:32,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:34:25,579 INFO L290 TraceCheckUtils]: 36: Hoare triple {923#false} assume !false; {923#false} is VALID [2022-04-08 07:34:25,580 INFO L290 TraceCheckUtils]: 35: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {923#false} is VALID [2022-04-08 07:34:25,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:34:25,581 INFO L272 TraceCheckUtils]: 33: Hoare triple {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:34:25,582 INFO L290 TraceCheckUtils]: 32: Hoare triple {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:34:25,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {1060#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1053#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:34:25,591 INFO L290 TraceCheckUtils]: 30: Hoare triple {1064#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {1060#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:34:25,591 INFO L290 TraceCheckUtils]: 29: Hoare triple {1064#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {1064#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:34:26,035 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} {922#true} #67#return; {1064#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:34:26,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:34:26,036 INFO L290 TraceCheckUtils]: 26: Hoare triple {1080#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:34:26,036 INFO L290 TraceCheckUtils]: 25: Hoare triple {922#true} ~cond := #in~cond; {1080#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:34:26,036 INFO L272 TraceCheckUtils]: 24: Hoare triple {922#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {922#true} is VALID [2022-04-08 07:34:26,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {922#true} assume !false; {922#true} is VALID [2022-04-08 07:34:26,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {922#true} {922#true} #65#return; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 20: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L272 TraceCheckUtils]: 17: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {922#true} is VALID [2022-04-08 07:34:26,037 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {922#true} {922#true} #63#return; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L272 TraceCheckUtils]: 12: Hoare triple {922#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 07:34:26,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {922#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {922#true} is VALID [2022-04-08 07:34:26,037 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {922#true} {922#true} #61#return; {922#true} is VALID [2022-04-08 07:34:26,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:34:26,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {922#true} assume !(0 == ~cond); {922#true} is VALID [2022-04-08 07:34:26,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {922#true} ~cond := #in~cond; {922#true} is VALID [2022-04-08 07:34:26,038 INFO L272 TraceCheckUtils]: 6: Hoare triple {922#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {922#true} is VALID [2022-04-08 07:34:26,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {922#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {922#true} is VALID [2022-04-08 07:34:26,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {922#true} call #t~ret6 := main(); {922#true} is VALID [2022-04-08 07:34:26,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {922#true} {922#true} #71#return; {922#true} is VALID [2022-04-08 07:34:26,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {922#true} assume true; {922#true} is VALID [2022-04-08 07:34:26,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {922#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(13, 2);call #Ultimate.allocInit(12, 3); {922#true} is VALID [2022-04-08 07:34:26,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {922#true} call ULTIMATE.init(); {922#true} is VALID [2022-04-08 07:34:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:34:26,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:34:26,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613521948] [2022-04-08 07:34:26,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:34:26,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558981678] [2022-04-08 07:34:26,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558981678] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:34:26,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:34:26,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-08 07:34:26,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:34:26,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [756261667] [2022-04-08 07:34:26,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [756261667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:34:26,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:34:26,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:34:26,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053852974] [2022-04-08 07:34:26,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:34:26,063 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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 37 [2022-04-08 07:34:26,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:34:26,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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-08 07:34:28,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:34:28,097 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:34:28,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:28,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:34:28,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:34:28,098 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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-08 07:34:30,860 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-08 07:34:32,862 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-08 07:34:35,480 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:34:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:35,991 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-08 07:34:35,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:34:35,991 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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 37 [2022-04-08 07:34:35,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:34:35,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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-08 07:34:35,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-08 07:34:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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-08 07:34:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 53 transitions. [2022-04-08 07:34:35,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 53 transitions. [2022-04-08 07:34:36,321 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:34:36,322 INFO L225 Difference]: With dead ends: 49 [2022-04-08 07:34:36,322 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 07:34:36,323 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:34:36,323 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:34:36,324 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 149 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 2 Unknown, 0 Unchecked, 6.3s Time] [2022-04-08 07:34:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 07:34:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-04-08 07:34:36,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:34:36,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:34:36,357 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:34:36,357 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:34:36,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:36,359 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 07:34:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 07:34:36,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:36,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:36,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-08 07:34:36,360 INFO L87 Difference]: Start difference. First operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 47 states. [2022-04-08 07:34:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:34:36,362 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-08 07:34:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2022-04-08 07:34:36,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:34:36,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:34:36,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:34:36,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:34:36,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:34:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-08 07:34:36,365 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 37 [2022-04-08 07:34:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:34:36,365 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-08 07:34:36,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 9 states have internal predecessors, (19), 3 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-08 07:34:36,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-08 07:34:36,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:34:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-08 07:34:36,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 07:34:36,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:34:36,922 INFO L499 BasicCegarLoop]: trace histogram [3, 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] [2022-04-08 07:34:36,939 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-08 07:34:37,122 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-08 07:34:37,122 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:34:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:34:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 1 times [2022-04-08 07:34:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:34:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [98961264] [2022-04-08 07:34:37,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:34:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -497884428, now seen corresponding path program 2 times [2022-04-08 07:34:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:34:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812794266] [2022-04-08 07:34:37,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:34:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:34:37,150 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:34:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [197667487] [2022-04-08 07:34:37,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:34:37,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:34:37,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:34:37,154 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-08 07:34:37,174 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-08 07:34:37,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:34:37,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:34:37,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 07:34:37,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:34:37,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:34:38,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2022-04-08 07:34:38,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#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(13, 2);call #Ultimate.allocInit(12, 3); {1438#true} is VALID [2022-04-08 07:34:38,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:34:38,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #71#return; {1438#true} is VALID [2022-04-08 07:34:38,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret6 := main(); {1438#true} is VALID [2022-04-08 07:34:38,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L272 TraceCheckUtils]: 6: Hoare triple {1438#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1438#true} {1438#true} #61#return; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {1438#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L272 TraceCheckUtils]: 12: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:34:38,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:34:38,842 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1438#true} {1438#true} #63#return; {1438#true} is VALID [2022-04-08 07:34:38,842 INFO L272 TraceCheckUtils]: 17: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:34:38,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {1438#true} ~cond := #in~cond; {1497#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:34:38,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1497#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:34:38,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:34:38,844 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} {1438#true} #65#return; {1508#(<= 1 main_~b~0)} is VALID [2022-04-08 07:34:38,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {1508#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:34:38,845 INFO L290 TraceCheckUtils]: 23: Hoare triple {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:34:38,845 INFO L272 TraceCheckUtils]: 24: Hoare triple {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:34:38,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:34:38,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:34:38,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:34:38,846 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1438#true} {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:34:38,847 INFO L290 TraceCheckUtils]: 29: Hoare triple {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:34:38,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {1512#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1537#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:34:38,848 INFO L290 TraceCheckUtils]: 31: Hoare triple {1537#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1541#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:34:38,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {1541#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {1541#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:34:38,851 INFO L272 TraceCheckUtils]: 33: Hoare triple {1541#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:34:38,851 INFO L290 TraceCheckUtils]: 34: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:34:38,852 INFO L290 TraceCheckUtils]: 35: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1439#false} is VALID [2022-04-08 07:34:38,852 INFO L290 TraceCheckUtils]: 36: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2022-04-08 07:34:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:34:38,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:35:01,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {1439#false} assume !false; {1439#false} is VALID [2022-04-08 07:35:01,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {1552#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1439#false} is VALID [2022-04-08 07:35:01,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1552#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:01,469 INFO L272 TraceCheckUtils]: 33: Hoare triple {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1548#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:35:01,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:35:01,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {1575#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {1568#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:35:01,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {1575#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:35:01,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:35:01,477 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1438#true} {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #67#return; {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:35:01,478 INFO L290 TraceCheckUtils]: 27: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:35:01,478 INFO L290 TraceCheckUtils]: 26: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:35:01,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:35:01,478 INFO L272 TraceCheckUtils]: 24: Hoare triple {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:35:01,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:35:01,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {1604#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {1579#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:35:01,481 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} {1438#true} #65#return; {1604#(or (= (* main_~b~0 main_~a~0) (* (* main_~a~0 2) (+ (div main_~b~0 2) 1))) (= (mod main_~b~0 2) 0) (<= 0 main_~b~0))} is VALID [2022-04-08 07:35:01,482 INFO L290 TraceCheckUtils]: 20: Hoare triple {1501#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:35:01,482 INFO L290 TraceCheckUtils]: 19: Hoare triple {1617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1501#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:35:01,482 INFO L290 TraceCheckUtils]: 18: Hoare triple {1438#true} ~cond := #in~cond; {1617#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 07:35:01,482 INFO L272 TraceCheckUtils]: 17: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:35:01,482 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1438#true} {1438#true} #63#return; {1438#true} is VALID [2022-04-08 07:35:01,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 14: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 13: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L272 TraceCheckUtils]: 12: Hoare triple {1438#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {1438#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1438#true} {1438#true} #61#return; {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {1438#true} assume !(0 == ~cond); {1438#true} is VALID [2022-04-08 07:35:01,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#true} ~cond := #in~cond; {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L272 TraceCheckUtils]: 6: Hoare triple {1438#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {1438#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L272 TraceCheckUtils]: 4: Hoare triple {1438#true} call #t~ret6 := main(); {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1438#true} {1438#true} #71#return; {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {1438#true} assume true; {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {1438#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(13, 2);call #Ultimate.allocInit(12, 3); {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {1438#true} call ULTIMATE.init(); {1438#true} is VALID [2022-04-08 07:35:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-08 07:35:01,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:35:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812794266] [2022-04-08 07:35:01,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:35:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197667487] [2022-04-08 07:35:01,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197667487] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:35:01,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:35:01,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-04-08 07:35:01,485 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:35:01,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [98961264] [2022-04-08 07:35:01,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [98961264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:35:01,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:35:01,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 07:35:01,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948726192] [2022-04-08 07:35:01,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:35:01,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 07:35:01,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:35:01,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:35:01,520 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-08 07:35:01,521 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 07:35:01,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 07:35:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-08 07:35:01,521 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:35:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:02,057 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 07:35:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:35:02,057 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-08 07:35:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:35:02,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:35:02,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 07:35:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:35:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 07:35:02,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-08 07:35:02,110 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-08 07:35:02,112 INFO L225 Difference]: With dead ends: 59 [2022-04-08 07:35:02,112 INFO L226 Difference]: Without dead ends: 52 [2022-04-08 07:35:02,112 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:35:02,113 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:35:02,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 129 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 07:35:02,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-08 07:35:02,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-08 07:35:02,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:35:02,147 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:35:02,147 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:35:02,147 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:35:02,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:02,149 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-08 07:35:02,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-08 07:35:02,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:02,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:02,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-08 07:35:02,150 INFO L87 Difference]: Start difference. First operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 52 states. [2022-04-08 07:35:02,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:02,152 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-04-08 07:35:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2022-04-08 07:35:02,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:02,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:02,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:35:02,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:35:02,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.121212121212121) internal successors, (37), 35 states have internal predecessors, (37), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:35:02,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 07:35:02,155 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2022-04-08 07:35:02,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:35:02,155 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 07:35:02,155 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-08 07:35:02,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 07:35:02,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:35:02,431 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 07:35:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 07:35:02,432 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:35:02,432 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2022-04-08 07:35:02,452 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-08 07:35:02,639 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-08 07:35:02,639 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:35:02,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:35:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 1 times [2022-04-08 07:35:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [983546503] [2022-04-08 07:35:02,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:35:02,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1351630086, now seen corresponding path program 2 times [2022-04-08 07:35:02,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:35:02,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997817044] [2022-04-08 07:35:02,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:35:02,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:35:02,656 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:35:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1678579781] [2022-04-08 07:35:02,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:35:02,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:35:02,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:35:02,657 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-08 07:35:02,658 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-08 07:35:02,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:35:02,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:35:02,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 07:35:02,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:35:02,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:35:10,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-08 07:35:10,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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(13, 2);call #Ultimate.allocInit(12, 3); {2000#true} is VALID [2022-04-08 07:35:10,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2000#true} {2000#true} #71#return; {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {2000#true} call #t~ret6 := main(); {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2000#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {2000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:10,902 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2000#true} {2000#true} #61#return; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L272 TraceCheckUtils]: 12: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2000#true} {2000#true} #63#return; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L272 TraceCheckUtils]: 17: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:10,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2000#true} {2000#true} #65#return; {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 22: Hoare triple {2000#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L272 TraceCheckUtils]: 24: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:10,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2000#true} {2000#true} #67#return; {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} assume !!(0 != ~y~0); {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L290 TraceCheckUtils]: 32: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 07:35:10,905 INFO L272 TraceCheckUtils]: 33: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:10,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {2000#true} ~cond := #in~cond; {2107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:10,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {2107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:10,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:12,910 WARN L284 TraceCheckUtils]: 37: Hoare quadruple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} {2000#true} #67#return; {2118#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} is UNKNOWN [2022-04-08 07:35:12,923 INFO L290 TraceCheckUtils]: 38: Hoare triple {2118#(or (and (not (= main_~y~0 0)) (= (mod (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) main_~y~0) 0)) (= (+ (* (- 1) main_~z~0) (* main_~b~0 main_~a~0)) 0))} assume !(0 != ~y~0); {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:35:12,932 INFO L272 TraceCheckUtils]: 39: Hoare triple {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:35:12,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:12,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {2130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2001#false} is VALID [2022-04-08 07:35:12,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-08 07:35:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 07:35:12,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:35:20,764 INFO L290 TraceCheckUtils]: 42: Hoare triple {2001#false} assume !false; {2001#false} is VALID [2022-04-08 07:35:20,764 INFO L290 TraceCheckUtils]: 41: Hoare triple {2130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2001#false} is VALID [2022-04-08 07:35:20,765 INFO L290 TraceCheckUtils]: 40: Hoare triple {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:20,766 INFO L272 TraceCheckUtils]: 39: Hoare triple {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 == ~a~0 * ~b~0 then 1 else 0)); {2126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:35:20,766 INFO L290 TraceCheckUtils]: 38: Hoare triple {2149#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} assume !(0 != ~y~0); {2122#(= main_~z~0 (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:35:20,767 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} {2000#true} #67#return; {2149#(or (not (= main_~y~0 0)) (= main_~z~0 (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:35:20,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:20,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {2162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:20,769 INFO L290 TraceCheckUtils]: 34: Hoare triple {2000#true} ~cond := #in~cond; {2162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:35:20,769 INFO L272 TraceCheckUtils]: 33: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:20,769 INFO L290 TraceCheckUtils]: 32: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 07:35:20,769 INFO L290 TraceCheckUtils]: 31: Hoare triple {2000#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2000#true} is VALID [2022-04-08 07:35:20,769 INFO L290 TraceCheckUtils]: 30: Hoare triple {2000#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 29: Hoare triple {2000#true} assume !!(0 != ~y~0); {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2000#true} {2000#true} #67#return; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 26: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L272 TraceCheckUtils]: 24: Hoare triple {2000#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {2000#true} assume !false; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {2000#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2000#true} {2000#true} #65#return; {2000#true} is VALID [2022-04-08 07:35:20,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L272 TraceCheckUtils]: 17: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2000#true} {2000#true} #63#return; {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L272 TraceCheckUtils]: 12: Hoare triple {2000#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:20,771 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2000#true} {2000#true} #61#return; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#true} assume !(0 == ~cond); {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#true} ~cond := #in~cond; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {2000#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {2000#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {2000#true} call #t~ret6 := main(); {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2000#true} {2000#true} #71#return; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {2000#true} assume true; {2000#true} is VALID [2022-04-08 07:35:20,772 INFO L290 TraceCheckUtils]: 1: Hoare triple {2000#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(13, 2);call #Ultimate.allocInit(12, 3); {2000#true} is VALID [2022-04-08 07:35:20,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {2000#true} call ULTIMATE.init(); {2000#true} is VALID [2022-04-08 07:35:20,773 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 07:35:20,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:35:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997817044] [2022-04-08 07:35:20,773 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:35:20,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678579781] [2022-04-08 07:35:20,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678579781] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:35:20,773 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:35:20,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 07:35:20,774 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:35:20,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [983546503] [2022-04-08 07:35:20,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [983546503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:35:20,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:35:20,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 07:35:20,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661436140] [2022-04-08 07:35:20,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:35:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-08 07:35:20,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:35:20,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:35:22,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:35:22,811 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 07:35:22,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:22,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 07:35:22,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 07:35:22,812 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:35:24,865 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-08 07:35:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:25,223 INFO L93 Difference]: Finished difference Result 57 states and 61 transitions. [2022-04-08 07:35:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 07:35:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 43 [2022-04-08 07:35:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:35:25,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:35:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 07:35:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:35:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 37 transitions. [2022-04-08 07:35:25,226 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 37 transitions. [2022-04-08 07:35:27,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 36 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:35:27,267 INFO L225 Difference]: With dead ends: 57 [2022-04-08 07:35:27,267 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 07:35:27,267 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 07:35:27,268 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-08 07:35:27,268 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 123 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 1 Unknown, 0 Unchecked, 2.1s Time] [2022-04-08 07:35:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 07:35:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2022-04-08 07:35:27,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:35:27,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:35:27,301 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:35:27,301 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:35:27,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:27,302 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 07:35:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 07:35:27,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:27,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:27,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 07:35:27,303 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-08 07:35:27,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:35:27,305 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-04-08 07:35:27,305 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-08 07:35:27,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:35:27,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:35:27,305 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:35:27,305 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:35:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 07:35:27,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-04-08 07:35:27,307 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 43 [2022-04-08 07:35:27,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:35:27,307 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-04-08 07:35:27,307 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:35:27,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 45 transitions. [2022-04-08 07:35:33,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 42 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 07:35:33,921 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-08 07:35:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 07:35:33,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:35:33,921 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:35:33,938 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-08 07:35:34,122 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-08 07:35:34,122 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:35:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:35:34,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1025268728, now seen corresponding path program 3 times [2022-04-08 07:35:34,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:35:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [586494425] [2022-04-08 07:35:34,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:35:34,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1025268728, now seen corresponding path program 4 times [2022-04-08 07:35:34,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:35:34,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051811833] [2022-04-08 07:35:34,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:35:34,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:35:34,138 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:35:34,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715764731] [2022-04-08 07:35:34,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:35:34,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:35:34,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:35:34,140 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-08 07:35:34,149 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-08 07:35:34,193 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:35:34,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:35:34,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 07:35:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:35:34,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:35:42,154 INFO L272 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {2567#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(13, 2);call #Ultimate.allocInit(12, 3); {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L290 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #71#return; {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L272 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret6 := main(); {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {2567#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2567#true} is VALID [2022-04-08 07:35:42,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {2567#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 8: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2567#true} {2567#true} #61#return; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {2567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L272 TraceCheckUtils]: 12: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:35:42,156 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L272 TraceCheckUtils]: 17: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L290 TraceCheckUtils]: 20: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2567#true} {2567#true} #65#return; {2567#true} is VALID [2022-04-08 07:35:42,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {2567#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:35:42,158 INFO L290 TraceCheckUtils]: 23: Hoare triple {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:35:42,158 INFO L272 TraceCheckUtils]: 24: Hoare triple {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:35:42,158 INFO L290 TraceCheckUtils]: 25: Hoare triple {2567#true} ~cond := #in~cond; {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:42,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:42,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:42,160 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:35:42,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {2638#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {2662#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:35:42,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {2662#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2666#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:35:42,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {2666#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (= main_~z~0 main_~x~0) (<= 0 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:35:42,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:35:42,165 INFO L272 TraceCheckUtils]: 33: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:35:42,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {2567#true} ~cond := #in~cond; {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:42,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {2648#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:42,171 INFO L290 TraceCheckUtils]: 36: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:35:42,171 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:35:42,172 INFO L290 TraceCheckUtils]: 38: Hoare triple {2670#(and (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {2692#(and (not (= main_~y~0 0)) (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:35:42,173 INFO L290 TraceCheckUtils]: 39: Hoare triple {2692#(and (not (= main_~y~0 0)) (= main_~a~0 main_~z~0) (<= 1 (mod main_~b~0 2)) (= main_~x~0 (* main_~z~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2696#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:35:42,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {2696#(and (<= 1 (mod (+ main_~y~0 1) 2)) (<= 1 (mod main_~b~0 2)) (= (+ main_~a~0 main_~x~0) main_~z~0) (= (* main_~a~0 2) main_~x~0) (= (div (+ (- 1) main_~b~0) 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} is VALID [2022-04-08 07:35:42,176 INFO L290 TraceCheckUtils]: 41: Hoare triple {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} assume !false; {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} is VALID [2022-04-08 07:35:43,900 INFO L272 TraceCheckUtils]: 42: Hoare triple {2700#(and (= main_~x~0 (+ (* main_~z~0 2) (* (- 2) main_~a~0))) (= (* main_~a~0 2) (+ (* (- 1) main_~a~0) main_~z~0)) (<= 1 (mod main_~b~0 2)) (<= 0 (div (+ (- 1) main_~b~0) 2)) (= (div (+ (- 1) (div (+ (- 1) main_~b~0) 2)) 2) main_~y~0) (<= 1 (mod (div (+ (- 1) main_~b~0) 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:35:43,901 INFO L290 TraceCheckUtils]: 43: Hoare triple {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:35:43,901 INFO L290 TraceCheckUtils]: 44: Hoare triple {2711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2022-04-08 07:35:43,901 INFO L290 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2022-04-08 07:35:43,902 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 07:35:43,902 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:36:44,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2022-04-08 07:36:44,816 INFO L290 TraceCheckUtils]: 44: Hoare triple {2711#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2022-04-08 07:36:44,816 INFO L290 TraceCheckUtils]: 43: Hoare triple {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2711#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:36:44,817 INFO L272 TraceCheckUtils]: 42: Hoare triple {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2707#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:36:44,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:36:44,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {2734#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2727#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:36:44,828 INFO L290 TraceCheckUtils]: 39: Hoare triple {2738#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2734#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:36:44,828 INFO L290 TraceCheckUtils]: 38: Hoare triple {2738#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {2738#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:36:45,030 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} {2567#true} #67#return; {2738#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:36:45,030 INFO L290 TraceCheckUtils]: 36: Hoare triple {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:36:45,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {2754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {2652#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:36:45,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {2567#true} ~cond := #in~cond; {2754#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:36:45,031 INFO L272 TraceCheckUtils]: 33: Hoare triple {2567#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:36:45,031 INFO L290 TraceCheckUtils]: 32: Hoare triple {2567#true} assume !false; {2567#true} is VALID [2022-04-08 07:36:45,031 INFO L290 TraceCheckUtils]: 31: Hoare triple {2567#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {2567#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 29: Hoare triple {2567#true} assume !!(0 != ~y~0); {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2567#true} {2567#true} #67#return; {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 27: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L272 TraceCheckUtils]: 24: Hoare triple {2567#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {2567#true} assume !false; {2567#true} is VALID [2022-04-08 07:36:45,032 INFO L290 TraceCheckUtils]: 22: Hoare triple {2567#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2567#true} {2567#true} #65#return; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L272 TraceCheckUtils]: 17: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L272 TraceCheckUtils]: 12: Hoare triple {2567#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:36:45,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {2567#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2567#true} {2567#true} #61#return; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 9: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L272 TraceCheckUtils]: 6: Hoare triple {2567#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {2567#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret6 := main(); {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #71#return; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {2567#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(13, 2);call #Ultimate.allocInit(12, 3); {2567#true} is VALID [2022-04-08 07:36:45,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2022-04-08 07:36:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 07:36:45,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:36:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051811833] [2022-04-08 07:36:45,035 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:36:45,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715764731] [2022-04-08 07:36:45,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715764731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:36:45,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:36:45,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 07:36:45,036 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:36:45,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [586494425] [2022-04-08 07:36:45,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [586494425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:36:45,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:36:45,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:36:45,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179802543] [2022-04-08 07:36:45,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:36:45,037 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:36:45,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:36:45,037 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:36:45,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:36:45,955 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:36:45,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:36:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:36:45,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-08 07:36:45,956 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:36:50,295 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-08 07:36:59,295 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-08 07:37:03,964 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:37:12,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:37:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:37:17,703 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-08 07:37:17,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:37:17,703 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:37:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:37:17,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:37:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-08 07:37:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:37:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 59 transitions. [2022-04-08 07:37:17,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 59 transitions. [2022-04-08 07:37:21,729 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 58 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:37:21,731 INFO L225 Difference]: With dead ends: 61 [2022-04-08 07:37:21,731 INFO L226 Difference]: Without dead ends: 59 [2022-04-08 07:37:21,731 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-04-08 07:37:21,732 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2022-04-08 07:37:21,732 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 183 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 2 Unknown, 0 Unchecked, 13.6s Time] [2022-04-08 07:37:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-08 07:37:21,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-04-08 07:37:21,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:37:21,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:37:21,783 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:37:21,784 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:37:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:37:21,786 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 07:37:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 07:37:21,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:37:21,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:37:21,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 59 states. [2022-04-08 07:37:21,786 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 59 states. [2022-04-08 07:37:21,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:37:21,788 INFO L93 Difference]: Finished difference Result 59 states and 66 transitions. [2022-04-08 07:37:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 66 transitions. [2022-04-08 07:37:21,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:37:21,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:37:21,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:37:21,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:37:21,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:37:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-04-08 07:37:21,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 46 [2022-04-08 07:37:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:37:21,791 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-04-08 07:37:21,791 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 12 states have internal predecessors, (23), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:37:21,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 59 transitions. [2022-04-08 07:37:33,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 54 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 07:37:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-04-08 07:37:33,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 07:37:33,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:37:33,790 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:37:33,809 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 07:37:33,995 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-08 07:37:33,995 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:37:33,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:37:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 1 times [2022-04-08 07:37:33,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:37:33,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507558817] [2022-04-08 07:37:33,996 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:37:33,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1494691206, now seen corresponding path program 2 times [2022-04-08 07:37:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:37:33,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060541875] [2022-04-08 07:37:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:37:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:37:34,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:37:34,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1141239282] [2022-04-08 07:37:34,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 07:37:34,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:37:34,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:37:34,013 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-08 07:37:34,046 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-08 07:37:34,071 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 07:37:34,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:37:34,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 07:37:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:37:34,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:37:39,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {3209#true} call ULTIMATE.init(); {3209#true} is VALID [2022-04-08 07:37:39,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {3209#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(13, 2);call #Ultimate.allocInit(12, 3); {3209#true} is VALID [2022-04-08 07:37:39,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:37:39,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3209#true} {3209#true} #71#return; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {3209#true} call #t~ret6 := main(); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {3209#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L272 TraceCheckUtils]: 6: Hoare triple {3209#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 8: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 9: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3209#true} {3209#true} #61#return; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 11: Hoare triple {3209#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L272 TraceCheckUtils]: 12: Hoare triple {3209#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3209#true} {3209#true} #63#return; {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L272 TraceCheckUtils]: 17: Hoare triple {3209#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:37:39,821 INFO L290 TraceCheckUtils]: 18: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:37:39,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:37:39,827 INFO L290 TraceCheckUtils]: 20: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:37:39,827 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3209#true} {3209#true} #65#return; {3209#true} is VALID [2022-04-08 07:37:39,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {3209#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3280#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 07:37:39,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {3280#(= main_~b~0 main_~y~0)} assume !false; {3280#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 07:37:39,828 INFO L272 TraceCheckUtils]: 24: Hoare triple {3280#(= main_~b~0 main_~y~0)} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:37:39,828 INFO L290 TraceCheckUtils]: 25: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:37:39,828 INFO L290 TraceCheckUtils]: 26: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:37:39,828 INFO L290 TraceCheckUtils]: 27: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:37:39,828 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3209#true} {3280#(= main_~b~0 main_~y~0)} #67#return; {3280#(= main_~b~0 main_~y~0)} is VALID [2022-04-08 07:37:39,829 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#(= main_~b~0 main_~y~0)} assume !!(0 != ~y~0); {3302#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0))} is VALID [2022-04-08 07:37:39,829 INFO L290 TraceCheckUtils]: 30: Hoare triple {3302#(and (not (= main_~y~0 0)) (= main_~b~0 main_~y~0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3306#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0))} is VALID [2022-04-08 07:37:39,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {3306#(and (= main_~b~0 (+ main_~y~0 1)) (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3310#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:37:39,831 INFO L290 TraceCheckUtils]: 32: Hoare triple {3310#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !false; {3310#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:37:39,831 INFO L272 TraceCheckUtils]: 33: Hoare triple {3310#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:37:39,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {3209#true} ~cond := #in~cond; {3320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:37:39,832 INFO L290 TraceCheckUtils]: 35: Hoare triple {3320#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:37:39,833 INFO L290 TraceCheckUtils]: 36: Hoare triple {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:37:39,833 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} {3310#(and (<= 1 (mod main_~b~0 2)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} #67#return; {3331#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:37:39,834 INFO L290 TraceCheckUtils]: 38: Hoare triple {3331#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !!(0 != ~y~0); {3331#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:37:39,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {3331#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3338#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} is VALID [2022-04-08 07:37:41,512 INFO L290 TraceCheckUtils]: 40: Hoare triple {3338#(and (<= 1 (mod main_~b~0 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (<= 0 main_~b~0) (= (div (+ (- 1) main_~b~0) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3342#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:37:41,513 INFO L290 TraceCheckUtils]: 41: Hoare triple {3342#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} assume !false; {3342#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:37:43,515 WARN L272 TraceCheckUtils]: 42: Hoare triple {3342#(and (<= 1 (mod main_~b~0 2)) (= (div (div (+ (- 1) main_~b~0) 2) 2) main_~y~0) (= (+ main_~z~0 (* (div (+ (- 1) main_~b~0) 2) (div (- main_~x~0) (- 2)))) (* main_~b~0 main_~a~0)) (<= 0 main_~b~0) (not (= (mod (div (+ (- 1) main_~b~0) 2) 2) 1)) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3349#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 07:37:43,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:37:43,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {3353#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3210#false} is VALID [2022-04-08 07:37:43,516 INFO L290 TraceCheckUtils]: 45: Hoare triple {3210#false} assume !false; {3210#false} is VALID [2022-04-08 07:37:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 07:37:43,516 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:38:20,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {3210#false} assume !false; {3210#false} is VALID [2022-04-08 07:38:20,151 INFO L290 TraceCheckUtils]: 44: Hoare triple {3353#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3210#false} is VALID [2022-04-08 07:38:20,151 INFO L290 TraceCheckUtils]: 43: Hoare triple {3349#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3353#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:38:20,152 INFO L272 TraceCheckUtils]: 42: Hoare triple {3369#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3349#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:38:20,152 INFO L290 TraceCheckUtils]: 41: Hoare triple {3369#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {3369#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:38:20,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {3376#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3369#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:38:20,157 INFO L290 TraceCheckUtils]: 39: Hoare triple {3380#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3376#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:38:20,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {3380#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {3380#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:38:20,160 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} {3387#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {3380#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:38:20,160 INFO L290 TraceCheckUtils]: 36: Hoare triple {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:38:20,161 INFO L290 TraceCheckUtils]: 35: Hoare triple {3397#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:38:20,161 INFO L290 TraceCheckUtils]: 34: Hoare triple {3209#true} ~cond := #in~cond; {3397#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:38:20,161 INFO L272 TraceCheckUtils]: 33: Hoare triple {3387#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:38:20,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {3387#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {3387#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 07:38:20,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {3407#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3387#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {3209#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3407#(and (or (not (= (mod main_~y~0 2) 0)) (<= 0 (div main_~y~0 2)) (<= (div (- (div main_~y~0 2)) (- 2)) (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))) (or (<= 0 (+ (div main_~y~0 2) 1)) (= (mod main_~y~0 2) 0) (<= (div (+ (- 1) (* (- 1) (div main_~y~0 2))) (- 2)) (+ (div (+ (- 1) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {3209#true} assume !!(0 != ~y~0); {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3209#true} {3209#true} #67#return; {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L272 TraceCheckUtils]: 24: Hoare triple {3209#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 23: Hoare triple {3209#true} assume !false; {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {3209#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3209#true} is VALID [2022-04-08 07:38:20,165 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3209#true} {3209#true} #65#return; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L272 TraceCheckUtils]: 17: Hoare triple {3209#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3209#true} {3209#true} #63#return; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L272 TraceCheckUtils]: 12: Hoare triple {3209#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:38:20,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {3209#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3209#true} {3209#true} #61#return; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 8: Hoare triple {3209#true} assume !(0 == ~cond); {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {3209#true} ~cond := #in~cond; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L272 TraceCheckUtils]: 6: Hoare triple {3209#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {3209#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L272 TraceCheckUtils]: 4: Hoare triple {3209#true} call #t~ret6 := main(); {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3209#true} {3209#true} #71#return; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {3209#true} assume true; {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {3209#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(13, 2);call #Ultimate.allocInit(12, 3); {3209#true} is VALID [2022-04-08 07:38:20,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {3209#true} call ULTIMATE.init(); {3209#true} is VALID [2022-04-08 07:38:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 07:38:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:38:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060541875] [2022-04-08 07:38:20,168 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:38:20,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141239282] [2022-04-08 07:38:20,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141239282] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:38:20,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:38:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 19 [2022-04-08 07:38:20,169 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:38:20,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507558817] [2022-04-08 07:38:20,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507558817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:38:20,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:38:20,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:38:20,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169298021] [2022-04-08 07:38:20,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:38:20,170 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:38:20,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:38:20,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:38:22,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:38:22,337 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:38:22,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:38:22,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:38:22,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=281, Unknown=1, NotChecked=0, Total=342 [2022-04-08 07:38:22,338 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:38:25,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:38:29,589 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:38:30,921 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:38:32,924 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-08 07:38:38,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:38:38,686 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-08 07:38:38,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:38:38,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:38:38,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:38:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:38:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 07:38:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:38:38,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 07:38:38,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-08 07:38:41,204 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-08 07:38:41,206 INFO L225 Difference]: With dead ends: 65 [2022-04-08 07:38:41,206 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 07:38:41,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=73, Invalid=346, Unknown=1, NotChecked=0, Total=420 [2022-04-08 07:38:41,206 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-04-08 07:38:41,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 203 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 1 Unknown, 0 Unchecked, 9.2s Time] [2022-04-08 07:38:41,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 07:38:41,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2022-04-08 07:38:41,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:38:41,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:38:41,263 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:38:41,263 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:38:41,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:38:41,265 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-08 07:38:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-08 07:38:41,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:38:41,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:38:41,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-08 07:38:41,266 INFO L87 Difference]: Start difference. First operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 63 states. [2022-04-08 07:38:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:38:41,268 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-08 07:38:41,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-04-08 07:38:41,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:38:41,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:38:41,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:38:41,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:38:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 38 states have internal predecessors, (40), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:38:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2022-04-08 07:38:41,270 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 46 [2022-04-08 07:38:41,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:38:41,270 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2022-04-08 07:38:41,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 12 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:38:41,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 59 transitions. [2022-04-08 07:38:55,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 52 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-08 07:38:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2022-04-08 07:38:55,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 07:38:55,884 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:38:55,884 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:38:55,903 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-08 07:38:56,084 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-08 07:38:56,085 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:38:56,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:38:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 3 times [2022-04-08 07:38:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:38:56,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908041143] [2022-04-08 07:38:56,086 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:38:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 4200374, now seen corresponding path program 4 times [2022-04-08 07:38:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:38:56,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067115295] [2022-04-08 07:38:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:38:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:38:56,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:38:56,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928865366] [2022-04-08 07:38:56,100 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:38:56,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:38:56,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:38:56,101 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-08 07:38:56,111 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-08 07:38:56,152 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:38:56,152 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:38:56,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 07:38:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:38:56,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:38:58,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {3869#true} call ULTIMATE.init(); {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#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(13, 2);call #Ultimate.allocInit(12, 3); {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3869#true} {3869#true} #71#return; {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {3869#true} call #t~ret6 := main(); {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {3869#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {3869#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:38:58,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3869#true} {3869#true} #61#return; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {3869#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L272 TraceCheckUtils]: 12: Hoare triple {3869#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3869#true} {3869#true} #63#return; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L272 TraceCheckUtils]: 17: Hoare triple {3869#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:38:58,829 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3869#true} {3869#true} #65#return; {3869#true} is VALID [2022-04-08 07:38:58,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {3869#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:38:58,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !false; {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:38:58,830 INFO L272 TraceCheckUtils]: 24: Hoare triple {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:38:58,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:38:58,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:38:58,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:38:58,831 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3869#true} {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} #67#return; {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:38:58,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:38:58,832 INFO L290 TraceCheckUtils]: 30: Hoare triple {3940#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3965#(and (= main_~z~0 0) (or (not (= (mod main_~y~0 2) 1)) (< main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:38:58,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {3965#(and (= main_~z~0 0) (or (not (= (mod main_~y~0 2) 1)) (< main_~y~0 0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3969#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 07:38:58,833 INFO L290 TraceCheckUtils]: 32: Hoare triple {3969#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} assume !false; {3969#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 07:38:58,834 INFO L272 TraceCheckUtils]: 33: Hoare triple {3969#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:38:58,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {3869#true} ~cond := #in~cond; {3979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:38:58,834 INFO L290 TraceCheckUtils]: 35: Hoare triple {3979#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:38:58,834 INFO L290 TraceCheckUtils]: 36: Hoare triple {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:38:58,835 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} {3969#(and (= main_~z~0 0) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} #67#return; {3990#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 07:38:58,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {3990#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} assume !!(0 != ~y~0); {3994#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} is VALID [2022-04-08 07:38:58,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {3994#(and (= main_~z~0 0) (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (or (and (not (= (mod main_~b~0 2) 0)) (= main_~y~0 (+ (div main_~b~0 2) 1))) (and (= main_~y~0 (div main_~b~0 2)) (= (mod main_~b~0 2) 0))) (or (not (= (mod main_~b~0 2) 1)) (< main_~b~0 0)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {3998#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:38:58,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {3998#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (= (div main_~b~0 2) (+ main_~y~0 1)) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4002#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 07:38:58,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {4002#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} assume !false; {4002#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} is VALID [2022-04-08 07:39:00,849 WARN L272 TraceCheckUtils]: 42: Hoare triple {4002#(and (= (* main_~a~0 4) main_~x~0) (= (div (+ (- 1) (div main_~b~0 2)) 2) main_~y~0) (= (* main_~b~0 main_~a~0) (+ main_~z~0 (* (* main_~a~0 2) (+ (- 1) (div main_~b~0 2))))) (not (= (mod main_~b~0 2) 1)) (<= 0 (div main_~b~0 2)) (<= 1 (mod (div main_~b~0 2) 2)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4009#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 07:39:00,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {4009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:39:00,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {4013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3870#false} is VALID [2022-04-08 07:39:00,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {3870#false} assume !false; {3870#false} is VALID [2022-04-08 07:39:00,851 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-04-08 07:39:00,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:39:46,288 INFO L290 TraceCheckUtils]: 45: Hoare triple {3870#false} assume !false; {3870#false} is VALID [2022-04-08 07:39:46,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {4013#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3870#false} is VALID [2022-04-08 07:39:46,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {4009#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4013#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:39:46,290 INFO L272 TraceCheckUtils]: 42: Hoare triple {4029#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4009#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:39:46,290 INFO L290 TraceCheckUtils]: 41: Hoare triple {4029#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4029#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:39:46,294 INFO L290 TraceCheckUtils]: 40: Hoare triple {4036#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4029#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:39:46,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {4040#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {4036#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:39:46,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {4040#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {4040#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:39:46,535 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} {3869#true} #67#return; {4040#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:39:46,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 35: Hoare triple {4056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3983#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 34: Hoare triple {3869#true} ~cond := #in~cond; {4056#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:39:46,536 INFO L272 TraceCheckUtils]: 33: Hoare triple {3869#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {3869#true} assume !false; {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {3869#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 30: Hoare triple {3869#true} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {3869#true} assume !!(0 != ~y~0); {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3869#true} {3869#true} #67#return; {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:39:46,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 25: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L272 TraceCheckUtils]: 24: Hoare triple {3869#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {3869#true} assume !false; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {3869#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3869#true} {3869#true} #65#return; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L272 TraceCheckUtils]: 17: Hoare triple {3869#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3869#true} {3869#true} #63#return; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L272 TraceCheckUtils]: 12: Hoare triple {3869#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {3869#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3869#true} {3869#true} #61#return; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:39:46,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {3869#true} assume !(0 == ~cond); {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {3869#true} ~cond := #in~cond; {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L272 TraceCheckUtils]: 6: Hoare triple {3869#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {3869#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {3869#true} call #t~ret6 := main(); {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3869#true} {3869#true} #71#return; {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {3869#true} assume true; {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {3869#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(13, 2);call #Ultimate.allocInit(12, 3); {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {3869#true} call ULTIMATE.init(); {3869#true} is VALID [2022-04-08 07:39:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-08 07:39:46,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:39:46,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067115295] [2022-04-08 07:39:46,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:39:46,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928865366] [2022-04-08 07:39:46,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928865366] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:39:46,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:39:46,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2022-04-08 07:39:46,539 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:39:46,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908041143] [2022-04-08 07:39:46,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908041143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:39:46,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:39:46,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 07:39:46,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463146800] [2022-04-08 07:39:46,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:39:46,540 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:39:46,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:39:46,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:39:48,579 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 39 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:39:48,580 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 07:39:48,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:39:48,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 07:39:48,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=218, Unknown=1, NotChecked=0, Total=272 [2022-04-08 07:39:48,580 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:39:59,355 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-08 07:40:01,359 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-08 07:40:02,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:02,063 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-04-08 07:40:02,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 07:40:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:40:02,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:40:02,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:40:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 07:40:02,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:40:02,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 56 transitions. [2022-04-08 07:40:02,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 56 transitions. [2022-04-08 07:40:02,332 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-08 07:40:02,333 INFO L225 Difference]: With dead ends: 68 [2022-04-08 07:40:02,333 INFO L226 Difference]: Without dead ends: 66 [2022-04-08 07:40:02,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 74 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=66, Invalid=275, Unknown=1, NotChecked=0, Total=342 [2022-04-08 07:40:02,333 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 17 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-04-08 07:40:02,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 209 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 269 Invalid, 2 Unknown, 0 Unchecked, 7.3s Time] [2022-04-08 07:40:02,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-08 07:40:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-08 07:40:02,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:40:02,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:40:02,411 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:40:02,412 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:40:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:02,414 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-08 07:40:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-08 07:40:02,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:40:02,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:40:02,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-08 07:40:02,415 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-08 07:40:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:40:02,416 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-08 07:40:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-08 07:40:02,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:40:02,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:40:02,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:40:02,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:40:02,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.131578947368421) internal successors, (43), 39 states have internal predecessors, (43), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 07:40:02,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-04-08 07:40:02,419 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 46 [2022-04-08 07:40:02,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:40:02,419 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-04-08 07:40:02,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 4 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:40:02,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 62 transitions. [2022-04-08 07:40:16,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 56 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 07:40:16,335 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-04-08 07:40:16,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-08 07:40:16,336 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:40:16,336 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:40:16,352 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-08 07:40:16,536 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-08 07:40:16,536 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:40:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:40:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 3 times [2022-04-08 07:40:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:40:16,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1680894843] [2022-04-08 07:40:16,537 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:40:16,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1779207736, now seen corresponding path program 4 times [2022-04-08 07:40:16,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:40:16,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881928755] [2022-04-08 07:40:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:40:16,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:40:16,556 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:40:16,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508658627] [2022-04-08 07:40:16,556 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 07:40:16,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:40:16,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:40:16,564 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-08 07:40:16,567 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-08 07:40:16,602 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 07:40:16,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:40:16,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 07:40:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:40:16,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:40:21,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {4543#true} call ULTIMATE.init(); {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {4543#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(13, 2);call #Ultimate.allocInit(12, 3); {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4543#true} {4543#true} #71#return; {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L272 TraceCheckUtils]: 4: Hoare triple {4543#true} call #t~ret6 := main(); {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {4543#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L272 TraceCheckUtils]: 6: Hoare triple {4543#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 7: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 8: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:40:21,771 INFO L290 TraceCheckUtils]: 9: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4543#true} {4543#true} #61#return; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {4543#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {4543#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4543#true} {4543#true} #63#return; {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {4543#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:40:21,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {4543#true} ~cond := #in~cond; {4602#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:40:21,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {4602#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4606#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:40:21,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {4606#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4606#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:40:21,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4606#(not (= |assume_abort_if_not_#in~cond| 0))} {4543#true} #65#return; {4613#(<= 1 main_~b~0)} is VALID [2022-04-08 07:40:21,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {4613#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4617#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:40:21,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {4617#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !false; {4617#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:40:21,774 INFO L272 TraceCheckUtils]: 24: Hoare triple {4617#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:40:21,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {4543#true} ~cond := #in~cond; {4627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:40:21,775 INFO L290 TraceCheckUtils]: 26: Hoare triple {4627#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:40:21,775 INFO L290 TraceCheckUtils]: 27: Hoare triple {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:40:21,775 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} {4617#(and (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} #67#return; {4638#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:40:21,776 INFO L290 TraceCheckUtils]: 29: Hoare triple {4638#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !!(0 != ~y~0); {4638#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:40:21,776 INFO L290 TraceCheckUtils]: 30: Hoare triple {4638#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4645#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 07:40:21,777 INFO L290 TraceCheckUtils]: 31: Hoare triple {4645#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0) (= main_~a~0 main_~x~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:40:21,778 INFO L290 TraceCheckUtils]: 32: Hoare triple {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !false; {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:40:21,778 INFO L272 TraceCheckUtils]: 33: Hoare triple {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:40:21,778 INFO L290 TraceCheckUtils]: 34: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:40:21,778 INFO L290 TraceCheckUtils]: 35: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:40:21,778 INFO L290 TraceCheckUtils]: 36: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:40:21,778 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4543#true} {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} #67#return; {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:40:21,779 INFO L290 TraceCheckUtils]: 38: Hoare triple {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !!(0 != ~y~0); {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:40:21,780 INFO L290 TraceCheckUtils]: 39: Hoare triple {4649#(and (= main_~y~0 (div main_~b~0 2)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (+ main_~z~0 (* main_~b~0 main_~a~0)) (* main_~b~0 main_~a~0)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4674#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:40:21,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {4674#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (= (* main_~a~0 2) main_~x~0) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4678#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:40:21,781 INFO L290 TraceCheckUtils]: 41: Hoare triple {4678#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {4678#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:40:21,783 INFO L272 TraceCheckUtils]: 42: Hoare triple {4678#(and (= main_~z~0 0) (= (* main_~a~0 4) main_~x~0) (not (= (mod (div main_~b~0 2) 2) 1)) (= main_~y~0 (div (div main_~b~0 2) 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:40:21,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {4685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:40:21,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {4689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4544#false} is VALID [2022-04-08 07:40:21,784 INFO L290 TraceCheckUtils]: 45: Hoare triple {4544#false} assume !false; {4544#false} is VALID [2022-04-08 07:40:21,784 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 07:40:21,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:41:02,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {4544#false} assume !false; {4544#false} is VALID [2022-04-08 07:41:02,025 INFO L290 TraceCheckUtils]: 44: Hoare triple {4689#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4544#false} is VALID [2022-04-08 07:41:02,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {4685#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:41:02,027 INFO L272 TraceCheckUtils]: 42: Hoare triple {4705#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:41:02,027 INFO L290 TraceCheckUtils]: 41: Hoare triple {4705#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {4705#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:41:02,033 INFO L290 TraceCheckUtils]: 40: Hoare triple {4712#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4705#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:41:02,034 INFO L290 TraceCheckUtils]: 39: Hoare triple {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4712#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:41:02,035 INFO L290 TraceCheckUtils]: 38: Hoare triple {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:41:02,036 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {4543#true} {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} #67#return; {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:41:02,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:41:02,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:41:02,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:41:02,036 INFO L272 TraceCheckUtils]: 33: Hoare triple {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:41:02,037 INFO L290 TraceCheckUtils]: 32: Hoare triple {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !false; {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:41:02,047 INFO L290 TraceCheckUtils]: 31: Hoare triple {4741#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {4716#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:41:02,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {4745#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {4741#(and (or (not (< main_~y~0 0)) (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2)))))} is VALID [2022-04-08 07:41:02,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {4745#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} assume !!(0 != ~y~0); {4745#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-08 07:41:02,056 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} {4752#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} #67#return; {4745#(or (and (or (and (or (not (= (mod (+ (div main_~y~0 2) 1) 2) 0)) (= (+ main_~z~0 (* (* main_~x~0 4) (div (+ (div main_~y~0 2) 1) 2))) (* main_~b~0 main_~a~0))) (or (= (mod (+ (div main_~y~0 2) 1) 2) 0) (= (+ (* (* main_~x~0 4) (+ (div (+ (div main_~y~0 2) 1) 2) 1)) main_~z~0) (* main_~b~0 main_~a~0)))) (= (mod main_~y~0 2) 0)) (or (and (or (not (= (mod (div main_~y~0 2) 2) 0)) (= (+ main_~z~0 (* (div (div main_~y~0 2) 2) (* main_~x~0 4))) (* main_~b~0 main_~a~0))) (or (= (mod (div main_~y~0 2) 2) 0) (= (+ main_~z~0 (* (* main_~x~0 4) (+ (div (div main_~y~0 2) 2) 1))) (* main_~b~0 main_~a~0)))) (not (= (mod main_~y~0 2) 0)) (and (= (mod (div main_~y~0 2) 2) 1) (<= 0 (div main_~y~0 2))))) (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)))} is VALID [2022-04-08 07:41:02,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:41:02,057 INFO L290 TraceCheckUtils]: 26: Hoare triple {4762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4631#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:41:02,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {4543#true} ~cond := #in~cond; {4762#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:41:02,057 INFO L272 TraceCheckUtils]: 24: Hoare triple {4752#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:41:02,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {4752#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} assume !false; {4752#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} is VALID [2022-04-08 07:41:02,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {4772#(or (and (= (mod main_~b~0 2) 0) (= (mod (div main_~b~0 2) 2) 0)) (<= 0 main_~b~0))} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {4752#(or (<= 0 main_~y~0) (and (or (= (mod main_~y~0 2) 0) (= (* main_~y~0 main_~x~0) (+ (* 4 (* main_~x~0 (div (+ (div main_~y~0 2) 1) 2))) (* main_~x~0 4)))) (or (= (* main_~y~0 main_~x~0) (+ (* main_~x~0 4) (* (* main_~x~0 (div (div main_~y~0 2) 2)) 4))) (= (mod (div main_~y~0 2) 2) 0))))} is VALID [2022-04-08 07:41:02,059 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4606#(not (= |assume_abort_if_not_#in~cond| 0))} {4543#true} #65#return; {4772#(or (and (= (mod main_~b~0 2) 0) (= (mod (div main_~b~0 2) 2) 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 07:41:02,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {4606#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4606#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 19: Hoare triple {4785#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {4606#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 18: Hoare triple {4543#true} ~cond := #in~cond; {4785#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-08 07:41:02,060 INFO L272 TraceCheckUtils]: 17: Hoare triple {4543#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4543#true} {4543#true} #63#return; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L272 TraceCheckUtils]: 12: Hoare triple {4543#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4543#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4543#true} {4543#true} #61#return; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {4543#true} assume !(0 == ~cond); {4543#true} is VALID [2022-04-08 07:41:02,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {4543#true} ~cond := #in~cond; {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {4543#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L290 TraceCheckUtils]: 5: Hoare triple {4543#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L272 TraceCheckUtils]: 4: Hoare triple {4543#true} call #t~ret6 := main(); {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4543#true} {4543#true} #71#return; {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L290 TraceCheckUtils]: 2: Hoare triple {4543#true} assume true; {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L290 TraceCheckUtils]: 1: Hoare triple {4543#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(13, 2);call #Ultimate.allocInit(12, 3); {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L272 TraceCheckUtils]: 0: Hoare triple {4543#true} call ULTIMATE.init(); {4543#true} is VALID [2022-04-08 07:41:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-08 07:41:02,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:41:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881928755] [2022-04-08 07:41:02,062 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:41:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508658627] [2022-04-08 07:41:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508658627] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:41:02,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:41:02,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 07:41:02,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:41:02,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1680894843] [2022-04-08 07:41:02,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1680894843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:41:02,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:41:02,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 07:41:02,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296931704] [2022-04-08 07:41:02,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:41:02,063 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:41:02,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:41:02,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:41:02,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:02,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 07:41:02,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:02,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 07:41:02,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2022-04-08 07:41:02,100 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:41:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:03,466 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-08 07:41:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 07:41:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2022-04-08 07:41:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:41:03,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:41:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-08 07:41:03,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:41:03,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-08 07:41:03,469 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-08 07:41:03,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:03,529 INFO L225 Difference]: With dead ends: 71 [2022-04-08 07:41:03,529 INFO L226 Difference]: Without dead ends: 69 [2022-04-08 07:41:03,529 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2022-04-08 07:41:03,530 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-08 07:41:03,530 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 167 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-08 07:41:03,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-08 07:41:03,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 50. [2022-04-08 07:41:03,587 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:41:03,587 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:41:03,588 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:41:03,588 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:41:03,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:03,590 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-04-08 07:41:03,590 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-04-08 07:41:03,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:03,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:03,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 07:41:03,591 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 69 states. [2022-04-08 07:41:03,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:41:03,592 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-04-08 07:41:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-04-08 07:41:03,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:41:03,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:41:03,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:41:03,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:41:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:41:03,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 07:41:03,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 46 [2022-04-08 07:41:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:41:03,594 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 07:41:03,594 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 13 states have internal predecessors, (29), 4 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-08 07:41:03,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 07:41:15,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 50 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 07:41:15,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 07:41:15,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 07:41:15,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:41:15,355 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:41:15,370 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-08 07:41:15,555 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-08 07:41:15,555 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:41:15,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:41:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1060406066, now seen corresponding path program 5 times [2022-04-08 07:41:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:41:15,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [962773974] [2022-04-08 07:41:15,556 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:41:15,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1060406066, now seen corresponding path program 6 times [2022-04-08 07:41:15,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:41:15,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894748967] [2022-04-08 07:41:15,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:41:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:41:15,569 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:41:15,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1964870795] [2022-04-08 07:41:15,569 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:41:15,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:41:15,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:41:15,573 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-08 07:41:15,574 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-08 07:41:15,625 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-08 07:41:15,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:41:15,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-08 07:41:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:41:15,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:41:40,268 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 07:41:44,771 INFO L272 TraceCheckUtils]: 0: Hoare triple {5228#true} call ULTIMATE.init(); {5228#true} is VALID [2022-04-08 07:41:44,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {5228#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(13, 2);call #Ultimate.allocInit(12, 3); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5228#true} {5228#true} #71#return; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L272 TraceCheckUtils]: 4: Hoare triple {5228#true} call #t~ret6 := main(); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 5: Hoare triple {5228#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L272 TraceCheckUtils]: 6: Hoare triple {5228#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 9: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5228#true} {5228#true} #61#return; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 11: Hoare triple {5228#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L272 TraceCheckUtils]: 12: Hoare triple {5228#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 13: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5228#true} {5228#true} #63#return; {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {5228#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 19: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5228#true} {5228#true} #65#return; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {5228#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L272 TraceCheckUtils]: 24: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 26: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5228#true} {5228#true} #67#return; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {5228#true} assume !!(0 != ~y~0); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {5228#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {5228#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 32: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L272 TraceCheckUtils]: 33: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:41:44,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 36: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5228#true} {5228#true} #67#return; {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {5228#true} assume !!(0 != ~y~0); {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 39: Hoare triple {5228#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {5228#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L272 TraceCheckUtils]: 42: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 43: Hoare triple {5228#true} ~cond := #in~cond; {5362#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:41:44,774 INFO L290 TraceCheckUtils]: 44: Hoare triple {5362#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:41:44,775 INFO L290 TraceCheckUtils]: 45: Hoare triple {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:41:44,775 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} {5228#true} #67#return; {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:41:44,776 INFO L290 TraceCheckUtils]: 47: Hoare triple {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !!(0 != ~y~0); {5377#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} is VALID [2022-04-08 07:41:44,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {5377#(and (not (= main_~y~0 0)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5381#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:41:45,447 INFO L290 TraceCheckUtils]: 49: Hoare triple {5381#(and (<= 1 (mod (+ main_~y~0 1) 2)) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (<= 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5385#(and (exists ((aux_div_v_main_~y~0_56_28 Int) (aux_mod_v_main_~y~0_56_28 Int)) (and (= (+ (* (div (* (- 1) main_~x~0) (- 2)) aux_mod_v_main_~y~0_56_28) main_~z~0 (* (* (div (* (- 1) main_~x~0) (- 2)) aux_div_v_main_~y~0_56_28) 2)) (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0))) (<= 0 (+ (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28)) (<= 1 aux_mod_v_main_~y~0_56_28) (< aux_mod_v_main_~y~0_56_28 2) (= (div (+ (- 1) (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28) 2) main_~y~0))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:41:45,840 INFO L290 TraceCheckUtils]: 50: Hoare triple {5385#(and (exists ((aux_div_v_main_~y~0_56_28 Int) (aux_mod_v_main_~y~0_56_28 Int)) (and (= (+ (* (div (* (- 1) main_~x~0) (- 2)) aux_mod_v_main_~y~0_56_28) main_~z~0 (* (* (div (* (- 1) main_~x~0) (- 2)) aux_div_v_main_~y~0_56_28) 2)) (+ (div (* (- 1) main_~x~0) (- 2)) (* main_~b~0 main_~a~0))) (<= 0 (+ (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28)) (<= 1 aux_mod_v_main_~y~0_56_28) (< aux_mod_v_main_~y~0_56_28 2) (= (div (+ (- 1) (* aux_div_v_main_~y~0_56_28 2) aux_mod_v_main_~y~0_56_28) 2) main_~y~0))) (= (mod main_~x~0 2) 0))} assume !false; {5389#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:41:46,521 INFO L272 TraceCheckUtils]: 51: Hoare triple {5389#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:41:46,522 INFO L290 TraceCheckUtils]: 52: Hoare triple {5393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:41:46,523 INFO L290 TraceCheckUtils]: 53: Hoare triple {5397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5229#false} is VALID [2022-04-08 07:41:46,523 INFO L290 TraceCheckUtils]: 54: Hoare triple {5229#false} assume !false; {5229#false} is VALID [2022-04-08 07:41:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 07:41:46,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:42:48,031 INFO L290 TraceCheckUtils]: 54: Hoare triple {5229#false} assume !false; {5229#false} is VALID [2022-04-08 07:42:48,032 INFO L290 TraceCheckUtils]: 53: Hoare triple {5397#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5229#false} is VALID [2022-04-08 07:42:48,032 INFO L290 TraceCheckUtils]: 52: Hoare triple {5393#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5397#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:42:48,033 INFO L272 TraceCheckUtils]: 51: Hoare triple {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5393#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:42:48,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:42:48,039 INFO L290 TraceCheckUtils]: 49: Hoare triple {5419#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5373#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:42:48,042 INFO L290 TraceCheckUtils]: 48: Hoare triple {5423#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5419#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:42:48,042 INFO L290 TraceCheckUtils]: 47: Hoare triple {5423#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} assume !!(0 != ~y~0); {5423#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:42:48,336 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} {5228#true} #67#return; {5423#(or (= (+ (* (* main_~x~0 2) (div (+ (- 1) main_~y~0) 2)) main_~z~0 main_~x~0) (* main_~b~0 main_~a~0)) (not (<= 1 (mod main_~y~0 2))) (< main_~y~0 0))} is VALID [2022-04-08 07:42:48,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {5439#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5366#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {5228#true} ~cond := #in~cond; {5439#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:42:48,337 INFO L272 TraceCheckUtils]: 42: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 41: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {5228#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {5228#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {5228#true} assume !!(0 != ~y~0); {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5228#true} {5228#true} #67#return; {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L272 TraceCheckUtils]: 33: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {5228#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {5228#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {5228#true} assume !!(0 != ~y~0); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5228#true} {5228#true} #67#return; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L272 TraceCheckUtils]: 24: Hoare triple {5228#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {5228#true} assume !false; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {5228#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5228#true} {5228#true} #65#return; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L272 TraceCheckUtils]: 17: Hoare triple {5228#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5228#true} {5228#true} #63#return; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L272 TraceCheckUtils]: 12: Hoare triple {5228#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 11: Hoare triple {5228#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5228#true} {5228#true} #61#return; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 9: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {5228#true} assume !(0 == ~cond); {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {5228#true} ~cond := #in~cond; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L272 TraceCheckUtils]: 6: Hoare triple {5228#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 5: Hoare triple {5228#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {5228#true} call #t~ret6 := main(); {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5228#true} {5228#true} #71#return; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5228#true} assume true; {5228#true} is VALID [2022-04-08 07:42:48,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {5228#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(13, 2);call #Ultimate.allocInit(12, 3); {5228#true} is VALID [2022-04-08 07:42:48,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {5228#true} call ULTIMATE.init(); {5228#true} is VALID [2022-04-08 07:42:48,340 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-04-08 07:42:48,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:42:48,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894748967] [2022-04-08 07:42:48,340 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:42:48,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964870795] [2022-04-08 07:42:48,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964870795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:42:48,340 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:42:48,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 14 [2022-04-08 07:42:48,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:42:48,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [962773974] [2022-04-08 07:42:48,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [962773974] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:42:48,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:42:48,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 07:42:48,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721799218] [2022-04-08 07:42:48,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:42:48,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-04-08 07:42:48,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:42:48,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:42:50,251 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-08 07:42:50,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 07:42:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:42:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 07:42:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=141, Unknown=2, NotChecked=0, Total=182 [2022-04-08 07:42:50,252 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:42:56,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:42:56,233 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2022-04-08 07:42:56,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 07:42:56,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 55 [2022-04-08 07:42:56,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:42:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:42:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-08 07:42:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:42:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2022-04-08 07:42:56,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2022-04-08 07:42:58,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:42:58,746 INFO L225 Difference]: With dead ends: 73 [2022-04-08 07:42:58,747 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 07:42:58,747 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=52, Invalid=186, Unknown=2, NotChecked=0, Total=240 [2022-04-08 07:42:58,747 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 17 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 19 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-08 07:42:58,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 130 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 19 Unchecked, 1.4s Time] [2022-04-08 07:42:58,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 07:42:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2022-04-08 07:42:58,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:42:58,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:42:58,806 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:42:58,806 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:42:58,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:42:58,809 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-08 07:42:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-08 07:42:58,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:42:58,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:42:58,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-08 07:42:58,811 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 71 states. [2022-04-08 07:42:58,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:42:58,813 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-04-08 07:42:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-08 07:42:58,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:42:58,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:42:58,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:42:58,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:42:58,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.1176470588235294) internal successors, (38), 35 states have internal predecessors, (38), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:42:58,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-08 07:42:58,815 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 55 [2022-04-08 07:42:58,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:42:58,815 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-08 07:42:58,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-08 07:42:58,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-08 07:43:10,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 51 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 07:43:10,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-08 07:43:10,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 07:43:10,418 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:43:10,418 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:43:10,437 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-08 07:43:10,618 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-08 07:43:10,619 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:43:10,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:43:10,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 5 times [2022-04-08 07:43:10,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:43:10,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1032265376] [2022-04-08 07:43:10,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:43:10,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1459553868, now seen corresponding path program 6 times [2022-04-08 07:43:10,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:43:10,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892242741] [2022-04-08 07:43:10,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:43:10,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:43:10,637 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:43:10,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1079166320] [2022-04-08 07:43:10,637 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:43:10,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:43:10,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:43:10,638 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-08 07:43:10,674 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-08 07:43:10,693 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:43:10,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:43:10,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 07:43:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:43:10,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:43:36,218 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 07:43:40,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {5963#true} call ULTIMATE.init(); {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {5963#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(13, 2);call #Ultimate.allocInit(12, 3); {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5963#true} {5963#true} #71#return; {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {5963#true} call #t~ret6 := main(); {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {5963#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L272 TraceCheckUtils]: 6: Hoare triple {5963#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5963#true} {5963#true} #61#return; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 11: Hoare triple {5963#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L272 TraceCheckUtils]: 12: Hoare triple {5963#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 15: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5963#true} {5963#true} #63#return; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L272 TraceCheckUtils]: 17: Hoare triple {5963#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 18: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,391 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5963#true} {5963#true} #65#return; {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L290 TraceCheckUtils]: 22: Hoare triple {5963#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L290 TraceCheckUtils]: 23: Hoare triple {5963#true} assume !false; {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L272 TraceCheckUtils]: 24: Hoare triple {5963#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:43:40,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5963#true} {5963#true} #67#return; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {5963#true} assume !!(0 != ~y~0); {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {5963#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {5963#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {5963#true} assume !false; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L272 TraceCheckUtils]: 33: Hoare triple {5963#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:43:40,396 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5963#true} {5963#true} #67#return; {5963#true} is VALID [2022-04-08 07:43:40,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {5963#true} assume !!(0 != ~y~0); {6082#(not (= main_~y~0 0))} is VALID [2022-04-08 07:43:40,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {6082#(not (= main_~y~0 0))} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {6086#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 07:43:40,401 INFO L290 TraceCheckUtils]: 40: Hoare triple {6086#(< 0 (+ main_~y~0 1))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6086#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 07:43:40,402 INFO L290 TraceCheckUtils]: 41: Hoare triple {6086#(< 0 (+ main_~y~0 1))} assume !false; {6086#(< 0 (+ main_~y~0 1))} is VALID [2022-04-08 07:43:40,402 INFO L272 TraceCheckUtils]: 42: Hoare triple {6086#(< 0 (+ main_~y~0 1))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:43:40,402 INFO L290 TraceCheckUtils]: 43: Hoare triple {5963#true} ~cond := #in~cond; {6099#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:40,403 INFO L290 TraceCheckUtils]: 44: Hoare triple {6099#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:43:40,403 INFO L290 TraceCheckUtils]: 45: Hoare triple {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:43:40,404 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} {6086#(< 0 (+ main_~y~0 1))} #67#return; {6110#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:43:40,404 INFO L290 TraceCheckUtils]: 47: Hoare triple {6110#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !!(0 != ~y~0); {6110#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:43:40,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {6110#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6117#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 0 (+ main_~y~0 1)))} is VALID [2022-04-08 07:43:40,515 INFO L290 TraceCheckUtils]: 49: Hoare triple {6117#(and (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (< 0 (+ main_~y~0 1)))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6121#(and (exists ((aux_div_v_main_~y~0_63_22 Int) (aux_mod_v_main_~y~0_63_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_63_22) (< 0 (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2) 1)) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)) 2)) (< aux_mod_v_main_~y~0_63_22 2) (not (= aux_mod_v_main_~y~0_63_22 1)))) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:43:40,808 INFO L290 TraceCheckUtils]: 50: Hoare triple {6121#(and (exists ((aux_div_v_main_~y~0_63_22 Int) (aux_mod_v_main_~y~0_63_22 Int)) (and (<= 0 aux_mod_v_main_~y~0_63_22) (< 0 (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2) 1)) (= (+ main_~z~0 (* (div (- main_~x~0) (- 2)) (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)))) (* main_~b~0 main_~a~0)) (= main_~y~0 (div (+ aux_mod_v_main_~y~0_63_22 (* aux_div_v_main_~y~0_63_22 2)) 2)) (< aux_mod_v_main_~y~0_63_22 2) (not (= aux_mod_v_main_~y~0_63_22 1)))) (= (mod main_~x~0 2) 0))} assume !false; {6125#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:43:42,811 WARN L272 TraceCheckUtils]: 51: Hoare triple {6125#(and (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (< 0 (+ main_~y~0 1)) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6129#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-08 07:43:42,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {6129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:43:42,812 INFO L290 TraceCheckUtils]: 53: Hoare triple {6133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5964#false} is VALID [2022-04-08 07:43:42,812 INFO L290 TraceCheckUtils]: 54: Hoare triple {5964#false} assume !false; {5964#false} is VALID [2022-04-08 07:43:42,812 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-08 07:43:42,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:44:21,719 INFO L290 TraceCheckUtils]: 54: Hoare triple {5964#false} assume !false; {5964#false} is VALID [2022-04-08 07:44:21,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {6133#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5964#false} is VALID [2022-04-08 07:44:21,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {6129#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6133#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:44:21,721 INFO L272 TraceCheckUtils]: 51: Hoare triple {6149#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6129#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:44:21,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {6149#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} assume !false; {6149#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:44:21,785 INFO L290 TraceCheckUtils]: 49: Hoare triple {6156#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6149#(= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0))} is VALID [2022-04-08 07:44:21,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {6160#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6156#(and (or (not (< main_~y~0 0)) (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (and (not (= (mod main_~y~0 2) 0)) (< main_~y~0 0))))} is VALID [2022-04-08 07:44:21,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {6160#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} assume !!(0 != ~y~0); {6160#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:44:21,793 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} {6167#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} #67#return; {6160#(or (and (<= 0 main_~y~0) (= (mod main_~y~0 2) 1)) (and (or (= (mod main_~y~0 2) 0) (= (+ main_~z~0 (* (* main_~x~0 2) (+ (div main_~y~0 2) 1))) (* main_~b~0 main_~a~0))) (or (= (+ main_~z~0 (* (* main_~x~0 2) (div main_~y~0 2))) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 0)))))} is VALID [2022-04-08 07:44:21,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:44:21,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {6177#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6103#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:44:21,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {5963#true} ~cond := #in~cond; {6177#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 07:44:21,794 INFO L272 TraceCheckUtils]: 42: Hoare triple {6167#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,794 INFO L290 TraceCheckUtils]: 41: Hoare triple {6167#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} assume !false; {6167#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 07:44:21,795 INFO L290 TraceCheckUtils]: 40: Hoare triple {6187#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6167#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0))} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {5963#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {6187#(and (<= 0 (+ (div main_~y~0 2) 1)) (or (not (= (mod main_~y~0 2) 0)) (<= 0 (+ (div (+ (- 2) (div main_~y~0 2)) 2) 1))))} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {5963#true} assume !!(0 != ~y~0); {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {5963#true} {5963#true} #67#return; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 36: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 35: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 34: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L272 TraceCheckUtils]: 33: Hoare triple {5963#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 32: Hoare triple {5963#true} assume !false; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {5963#true} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {5963#true} assume 1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2);~z~0 := ~z~0 + ~x~0;~y~0 := ~y~0 - 1; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {5963#true} assume !!(0 != ~y~0); {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5963#true} {5963#true} #67#return; {5963#true} is VALID [2022-04-08 07:44:21,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L272 TraceCheckUtils]: 24: Hoare triple {5963#true} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {5963#true} assume !false; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {5963#true} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5963#true} {5963#true} #65#return; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 20: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 19: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L272 TraceCheckUtils]: 17: Hoare triple {5963#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5963#true} {5963#true} #63#return; {5963#true} is VALID [2022-04-08 07:44:21,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L272 TraceCheckUtils]: 12: Hoare triple {5963#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {5963#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5963#true} {5963#true} #61#return; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {5963#true} assume !(0 == ~cond); {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {5963#true} ~cond := #in~cond; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {5963#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {5963#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {5963#true} is VALID [2022-04-08 07:44:21,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {5963#true} call #t~ret6 := main(); {5963#true} is VALID [2022-04-08 07:44:21,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5963#true} {5963#true} #71#return; {5963#true} is VALID [2022-04-08 07:44:21,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {5963#true} assume true; {5963#true} is VALID [2022-04-08 07:44:21,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {5963#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(13, 2);call #Ultimate.allocInit(12, 3); {5963#true} is VALID [2022-04-08 07:44:21,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {5963#true} call ULTIMATE.init(); {5963#true} is VALID [2022-04-08 07:44:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 25 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-04-08 07:44:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 07:44:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892242741] [2022-04-08 07:44:21,800 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 07:44:21,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079166320] [2022-04-08 07:44:21,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079166320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 07:44:21,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 07:44:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2022-04-08 07:44:21,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 07:44:21,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1032265376] [2022-04-08 07:44:21,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1032265376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 07:44:21,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 07:44:21,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 07:44:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652365234] [2022-04-08 07:44:21,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 07:44:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-04-08 07:44:21,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 07:44:21,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:44:24,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:24,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 07:44:24,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 07:44:24,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 07:44:24,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=240, Unknown=2, NotChecked=0, Total=306 [2022-04-08 07:44:24,713 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:44:36,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:44:40,055 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 07:44:49,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:49,634 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2022-04-08 07:44:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 07:44:49,634 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 55 [2022-04-08 07:44:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 07:44:49,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:44:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-08 07:44:49,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:44:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 55 transitions. [2022-04-08 07:44:49,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 55 transitions. [2022-04-08 07:44:53,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 07:44:53,351 INFO L225 Difference]: With dead ends: 84 [2022-04-08 07:44:53,351 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 07:44:53,351 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=139, Invalid=459, Unknown=2, NotChecked=0, Total=600 [2022-04-08 07:44:53,352 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-04-08 07:44:53,352 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 187 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 188 Invalid, 0 Unknown, 5 Unchecked, 8.8s Time] [2022-04-08 07:44:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 07:44:53,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 07:44:53,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 07:44:53,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:53,421 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:53,421 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:53,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:53,422 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-08 07:44:53,422 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 07:44:53,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:53,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:53,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-08 07:44:53,423 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-08 07:44:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 07:44:53,424 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2022-04-08 07:44:53,424 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 07:44:53,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 07:44:53,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 07:44:53,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 07:44:53,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 07:44:53,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 9 states have call successors, (9), 7 states have call predecessors, (9), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 07:44:53,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-08 07:44:53,426 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 55 [2022-04-08 07:44:53,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 07:44:53,426 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-08 07:44:53,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-08 07:44:53,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2022-04-08 07:45:06,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 46 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 07:45:06,510 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-08 07:45:06,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 07:45:06,510 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 07:45:06,510 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 07:45:06,530 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-08 07:45:06,711 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-08 07:45:06,711 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 07:45:06,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 07:45:06,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1954893684, now seen corresponding path program 5 times [2022-04-08 07:45:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 07:45:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113631187] [2022-04-08 07:45:06,712 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 07:45:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1954893684, now seen corresponding path program 6 times [2022-04-08 07:45:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 07:45:06,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477345125] [2022-04-08 07:45:06,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 07:45:06,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 07:45:06,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 07:45:06,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1492350202] [2022-04-08 07:45:06,726 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 07:45:06,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 07:45:06,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 07:45:06,727 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-08 07:45:06,731 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-08 07:45:06,772 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 07:45:06,772 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 07:45:06,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 07:45:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 07:45:06,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 07:45:34,227 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 07:46:21,864 INFO L272 TraceCheckUtils]: 0: Hoare triple {6692#true} call ULTIMATE.init(); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {6692#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(13, 2);call #Ultimate.allocInit(12, 3); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {6692#true} assume true; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6692#true} {6692#true} #71#return; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L272 TraceCheckUtils]: 4: Hoare triple {6692#true} call #t~ret6 := main(); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {6692#true} havoc ~a~0;havoc ~b~0;havoc ~x~0;havoc ~y~0;havoc ~z~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~a~0 := #t~nondet4;havoc #t~nondet4; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L272 TraceCheckUtils]: 6: Hoare triple {6692#true} call assume_abort_if_not((if ~a~0 >= 0 && ~a~0 <= 100 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {6692#true} ~cond := #in~cond; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {6692#true} assume !(0 == ~cond); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {6692#true} assume true; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6692#true} {6692#true} #61#return; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {6692#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~b~0 := #t~nondet5;havoc #t~nondet5; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L272 TraceCheckUtils]: 12: Hoare triple {6692#true} call assume_abort_if_not((if ~b~0 >= 0 && ~b~0 <= 100 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {6692#true} ~cond := #in~cond; {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {6692#true} assume !(0 == ~cond); {6692#true} is VALID [2022-04-08 07:46:21,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {6692#true} assume true; {6692#true} is VALID [2022-04-08 07:46:21,866 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6692#true} {6692#true} #63#return; {6692#true} is VALID [2022-04-08 07:46:21,866 INFO L272 TraceCheckUtils]: 17: Hoare triple {6692#true} call assume_abort_if_not((if ~b~0 >= 1 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,866 INFO L290 TraceCheckUtils]: 18: Hoare triple {6692#true} ~cond := #in~cond; {6751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 07:46:21,866 INFO L290 TraceCheckUtils]: 19: Hoare triple {6751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {6755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:46:21,866 INFO L290 TraceCheckUtils]: 20: Hoare triple {6755#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {6755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 07:46:21,867 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6755#(not (= |assume_abort_if_not_#in~cond| 0))} {6692#true} #65#return; {6762#(<= 1 main_~b~0)} is VALID [2022-04-08 07:46:21,867 INFO L290 TraceCheckUtils]: 22: Hoare triple {6762#(<= 1 main_~b~0)} ~x~0 := ~a~0;~y~0 := ~b~0;~z~0 := 0; {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !false; {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,868 INFO L272 TraceCheckUtils]: 24: Hoare triple {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,868 INFO L290 TraceCheckUtils]: 25: Hoare triple {6692#true} ~cond := #in~cond; {6692#true} is VALID [2022-04-08 07:46:21,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {6692#true} assume !(0 == ~cond); {6692#true} is VALID [2022-04-08 07:46:21,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {6692#true} assume true; {6692#true} is VALID [2022-04-08 07:46:21,868 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6692#true} {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} #67#return; {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {6766#(and (= main_~z~0 0) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6791#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {6791#(and (= main_~z~0 0) (not (= (mod main_~y~0 2) 1)) (= main_~b~0 main_~y~0) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !false; {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,871 INFO L272 TraceCheckUtils]: 33: Hoare triple {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,871 INFO L290 TraceCheckUtils]: 34: Hoare triple {6692#true} ~cond := #in~cond; {6692#true} is VALID [2022-04-08 07:46:21,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {6692#true} assume !(0 == ~cond); {6692#true} is VALID [2022-04-08 07:46:21,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {6692#true} assume true; {6692#true} is VALID [2022-04-08 07:46:21,872 INFO L284 TraceCheckUtils]: 37: Hoare quadruple {6692#true} {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} #67#return; {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !!(0 != ~y~0); {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,873 INFO L290 TraceCheckUtils]: 39: Hoare triple {6795#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6820#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} is VALID [2022-04-08 07:46:21,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {6820#(and (= main_~z~0 0) (= main_~y~0 (div main_~b~0 2)) (not (= (mod main_~y~0 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6824#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 07:46:21,875 INFO L290 TraceCheckUtils]: 41: Hoare triple {6824#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !false; {6824#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 07:46:21,875 INFO L272 TraceCheckUtils]: 42: Hoare triple {6824#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6692#true} is VALID [2022-04-08 07:46:21,875 INFO L290 TraceCheckUtils]: 43: Hoare triple {6692#true} ~cond := #in~cond; {6834#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:21,875 INFO L290 TraceCheckUtils]: 44: Hoare triple {6834#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:46:21,875 INFO L290 TraceCheckUtils]: 45: Hoare triple {6838#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6838#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 07:46:21,876 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {6838#(not (= |__VERIFIER_assert_#in~cond| 0))} {6824#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} #67#return; {6845#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 07:46:21,877 INFO L290 TraceCheckUtils]: 47: Hoare triple {6845#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !!(0 != ~y~0); {6845#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 07:46:21,878 INFO L290 TraceCheckUtils]: 48: Hoare triple {6845#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} assume !(1 == (if ~y~0 < 0 && 0 != ~y~0 % 2 then ~y~0 % 2 - 2 else ~y~0 % 2)); {6852#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} is VALID [2022-04-08 07:46:23,880 WARN L290 TraceCheckUtils]: 49: Hoare triple {6852#(and (= main_~z~0 0) (= (+ main_~z~0 (* main_~y~0 main_~x~0)) (* main_~b~0 main_~a~0)) (not (= (mod main_~y~0 2) 1)) (not (= (mod (div main_~b~0 2) 2) 1)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (<= (div (div main_~b~0 2) 2) main_~y~0))} ~x~0 := 2 * ~x~0;~y~0 := (if ~y~0 < 0 && 0 != ~y~0 % 2 then 1 + ~y~0 / 2 else ~y~0 / 2); {6856#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (exists ((aux_div_v_main_~y~0_71_22 Int) (aux_mod_v_main_~y~0_71_22 Int)) (and (= (+ (* (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) (div (- main_~x~0) (- 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= (div (div main_~b~0 2) 2) (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22)) (<= 0 aux_mod_v_main_~y~0_71_22) (not (= aux_mod_v_main_~y~0_71_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) 2)) (< aux_mod_v_main_~y~0_71_22 2))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is UNKNOWN [2022-04-08 07:46:23,885 INFO L290 TraceCheckUtils]: 50: Hoare triple {6856#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (exists ((aux_div_v_main_~y~0_71_22 Int) (aux_mod_v_main_~y~0_71_22 Int)) (and (= (+ (* (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) (div (- main_~x~0) (- 2))) main_~z~0) (* main_~b~0 main_~a~0)) (<= (div (div main_~b~0 2) 2) (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22)) (<= 0 aux_mod_v_main_~y~0_71_22) (not (= aux_mod_v_main_~y~0_71_22 1)) (= main_~y~0 (div (+ (* aux_div_v_main_~y~0_71_22 2) aux_mod_v_main_~y~0_71_22) 2)) (< aux_mod_v_main_~y~0_71_22 2))) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} assume !false; {6860#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (< (div (* (- 1) (div (div main_~b~0 2) 2)) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 07:46:25,227 INFO L272 TraceCheckUtils]: 51: Hoare triple {6860#(and (= main_~z~0 0) (not (= (mod (div main_~b~0 2) 2) 1)) (< (div (* (- 1) (div (div main_~b~0 2) 2)) (- 2)) (+ main_~y~0 1)) (= (+ main_~z~0 (* 2 (* (div (* (- 1) main_~x~0) (- 2)) main_~y~0))) (* main_~b~0 main_~a~0)) (not (= (mod main_~b~0 2) 1)) (<= 1 main_~b~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~z~0 + ~x~0 * ~y~0 == ~a~0 * ~b~0 then 1 else 0)); {6864#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 07:46:25,227 INFO L290 TraceCheckUtils]: 52: Hoare triple {6864#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6868#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 07:46:25,228 INFO L290 TraceCheckUtils]: 53: Hoare triple {6868#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6693#false} is VALID [2022-04-08 07:46:25,228 INFO L290 TraceCheckUtils]: 54: Hoare triple {6693#false} assume !false; {6693#false} is VALID [2022-04-08 07:46:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 07:46:25,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 07:47:05,168 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful