/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 13:12:55,924 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 13:12:55,925 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 13:12:55,961 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 13:12:55,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 13:12:55,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 13:12:55,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 13:12:55,972 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 13:12:55,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 13:12:55,978 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 13:12:55,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 13:12:55,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 13:12:55,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 13:12:55,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 13:12:55,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 13:12:55,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 13:12:55,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 13:12:55,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 13:12:55,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 13:12:55,992 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 13:12:55,993 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 13:12:55,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 13:12:55,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 13:12:55,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 13:12:55,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 13:12:56,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 13:12:56,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 13:12:56,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 13:12:56,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 13:12:56,001 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 13:12:56,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 13:12:56,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 13:12:56,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 13:12:56,002 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 13:12:56,002 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 13:12:56,003 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 13:12:56,003 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 13:12:56,003 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 13:12:56,004 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 13:12:56,004 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 13:12:56,004 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 13:12:56,006 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 13:12:56,007 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 13:12:56,017 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 13:12:56,017 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 13:12:56,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 13:12:56,018 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 13:12:56,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 13:12:56,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:56,019 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 13:12:56,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 13:12:56,020 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 13:12:56,020 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 13:12:56,020 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 13:12:56,020 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 13:12:56,020 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 13:12:56,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 13:12:56,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 13:12:56,202 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 13:12:56,203 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 13:12:56,203 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 13:12:56,204 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-08 13:12:56,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934bdba92/9d5383bc276842a7abb19b790826d759/FLAGd4389e89d [2022-04-08 13:12:56,602 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 13:12:56,603 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound5.c [2022-04-08 13:12:56,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934bdba92/9d5383bc276842a7abb19b790826d759/FLAGd4389e89d [2022-04-08 13:12:56,622 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934bdba92/9d5383bc276842a7abb19b790826d759 [2022-04-08 13:12:56,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 13:12:56,625 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 13:12:56,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:56,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 13:12:56,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 13:12:56,634 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d3854 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56, skipping insertion in model container [2022-04-08 13:12:56,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,639 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 13:12:56,651 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 13:12:56,807 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/hard2_unwindbound5.c[526,539] [2022-04-08 13:12:56,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:56,832 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 13:12:56,842 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/hard2_unwindbound5.c[526,539] [2022-04-08 13:12:56,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:56,866 INFO L208 MainTranslator]: Completed translation [2022-04-08 13:12:56,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56 WrapperNode [2022-04-08 13:12:56,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:56,867 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 13:12:56,867 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 13:12:56,868 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 13:12:56,876 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,881 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,881 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,896 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,904 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 13:12:56,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 13:12:56,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 13:12:56,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 13:12:56,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (1/1) ... [2022-04-08 13:12:56,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:56,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:56,936 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 13:12:56,955 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 13:12:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 13:12:56,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 13:12:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 13:12:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 13:12:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 13:12:56,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 13:12:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 13:12:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 13:12:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 13:12:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 13:12:56,974 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 13:12:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 13:12:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 13:12:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 13:12:56,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 13:12:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 13:12:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 13:12:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 13:12:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 13:12:56,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 13:12:57,022 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 13:12:57,024 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 13:12:57,140 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 13:12:57,144 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 13:12:57,145 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 13:12:57,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:57 BoogieIcfgContainer [2022-04-08 13:12:57,146 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 13:12:57,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 13:12:57,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 13:12:57,150 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 13:12:57,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:12:56" (1/3) ... [2022-04-08 13:12:57,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598bad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:57, skipping insertion in model container [2022-04-08 13:12:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:56" (2/3) ... [2022-04-08 13:12:57,151 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598bad9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:57, skipping insertion in model container [2022-04-08 13:12:57,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:57" (3/3) ... [2022-04-08 13:12:57,152 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound5.c [2022-04-08 13:12:57,155 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 13:12:57,155 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 13:12:57,180 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 13:12:57,184 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 13:12:57,184 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 13:12:57,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:12:57,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:57,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:57,199 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:57,199 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:57,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:57,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-08 13:12:57,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1014332467] [2022-04-08 13:12:57,214 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:57,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-08 13:12:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:57,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361253854] [2022-04-08 13:12:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:57,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:57,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 13:12:57,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:57,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:57,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:57,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 13:12:57,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:57,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:57,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-08 13:12:57,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-08 13:12:57,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 13:12:57,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 13:12:57,376 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-08 13:12:57,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 13:12:57,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 13:12:57,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 13:12:57,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:12:57,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:57,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361253854] [2022-04-08 13:12:57,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361253854] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:57,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:57,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:57,380 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:57,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1014332467] [2022-04-08 13:12:57,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1014332467] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:57,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:57,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:57,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93602281] [2022-04-08 13:12:57,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:57,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:57,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:57,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,400 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 13:12:57,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 13:12:57,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:12:57,414 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,595 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-08 13:12:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 13:12:57,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:57,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:57,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:57,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 13:12:57,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,713 INFO L225 Difference]: With dead ends: 57 [2022-04-08 13:12:57,713 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 13:12:57,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:12:57,722 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:57,724 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:57,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 13:12:57,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 13:12:57,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:57,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:57,773 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:57,774 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,777 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:57,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:57,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:57,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 13:12:57,778 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 13:12:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:57,781 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:57,781 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:57,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:57,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:57,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:57,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:57,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-08 13:12:57,785 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-08 13:12:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:57,785 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-08 13:12:57,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-08 13:12:57,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-08 13:12:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:57,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:57,818 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:57,818 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 13:12:57,818 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:57,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-08 13:12:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1882898503] [2022-04-08 13:12:57,823 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:57,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-08 13:12:57,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:57,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129133096] [2022-04-08 13:12:57,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:57,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:57,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:57,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 13:12:57,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:57,942 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:57,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:57,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 13:12:57,943 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:57,943 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:57,943 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-08 13:12:57,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:57,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:57,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 5);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:57,945 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:57,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:12:57,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-08 13:12:57,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 13:12:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:12:57,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:57,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129133096] [2022-04-08 13:12:57,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129133096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:57,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:57,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:57,947 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:57,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1882898503] [2022-04-08 13:12:57,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1882898503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:57,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:57,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:57,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852112020] [2022-04-08 13:12:57,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:57,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:57,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:57,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:57,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:57,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:57,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:57,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:57,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:57,960 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,197 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 13:12:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:58,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:58,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:58,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:58,201 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:58,244 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 13:12:58,245 INFO L225 Difference]: With dead ends: 41 [2022-04-08 13:12:58,245 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 13:12:58,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:58,247 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:58,247 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:58,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 13:12:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 13:12:58,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:58,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,252 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,253 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,255 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:58,255 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:58,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 13:12:58,266 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 13:12:58,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,268 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:58,268 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:58,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:58,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 13:12:58,271 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-08 13:12:58,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:58,271 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 13:12:58,271 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-08 13:12:58,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 13:12:58,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 13:12:58,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:58,308 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:58,308 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 13:12:58,308 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:58,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:58,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-08 13:12:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:58,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [627761038] [2022-04-08 13:12:58,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:58,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-08 13:12:58,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:58,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730180823] [2022-04-08 13:12:58,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:58,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:58,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,352 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,353 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:58,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:58,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-08 13:12:58,356 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 5);havoc #t~post5; {502#false} is VALID [2022-04-08 13:12:58,356 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-08 13:12:58,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 5);havoc #t~post6; {502#false} is VALID [2022-04-08 13:12:58,357 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-08 13:12:58,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-08 13:12:58,357 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-08 13:12:58,357 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-08 13:12:58,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:12:58,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:58,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730180823] [2022-04-08 13:12:58,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730180823] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:58,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:58,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:58,358 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:58,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [627761038] [2022-04-08 13:12:58,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [627761038] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:58,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:58,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:58,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935942242] [2022-04-08 13:12:58,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:58,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 13:12:58,360 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:58,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:58,368 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:58,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:58,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:58,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:58,369 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,497 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-08 13:12:58,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:58,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 13:12:58,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:58,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 13:12:58,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:58,543 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:58,543 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 13:12:58,543 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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 13:12:58,544 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:58,544 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:58,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 13:12:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 13:12:58,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:58,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,554 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,554 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,556 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:58,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 13:12:58,557 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 13:12:58,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,558 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:58,558 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:58,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:58,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 13:12:58,560 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 13:12:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:58,561 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 13:12:58,561 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:58,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 13:12:58,591 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:58,591 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:58,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 13:12:58,591 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:58,591 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:58,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 13:12:58,592 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:58,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:58,592 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-08 13:12:58,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:58,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1200396] [2022-04-08 13:12:58,593 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:58,593 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-08 13:12:58,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:58,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201834907] [2022-04-08 13:12:58,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:58,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 13:12:58,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:58,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 13:12:58,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:58,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:58,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:58,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:58,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:58,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:58,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 13:12:58,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:58,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:58,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-08 13:12:58,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:58,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:58,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 5);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:58,645 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-08 13:12:58,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:58,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:58,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:58,646 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:58,646 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:58,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:12:58,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-08 13:12:58,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-08 13:12:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:12:58,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201834907] [2022-04-08 13:12:58,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201834907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:58,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:58,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:58,653 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:58,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1200396] [2022-04-08 13:12:58,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1200396] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:58,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:58,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022074841] [2022-04-08 13:12:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:58,653 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 13:12:58,654 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:58,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:58,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:58,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:58,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:58,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:58,668 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:58,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,922 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 13:12:58,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 13:12:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:58,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:58,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:58,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:58,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:58,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:58,966 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 13:12:58,967 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:58,967 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 13:12:58,967 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:58,968 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:58,968 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:58,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 13:12:58,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-08 13:12:58,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:58,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,983 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,983 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,986 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:58,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 13:12:58,987 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 13:12:58,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:58,989 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:58,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:58,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:58,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:58,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-08 13:12:58,991 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-08 13:12:58,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:58,991 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-08 13:12:58,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:58,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-08 13:12:59,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-08 13:12:59,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 13:12:59,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:59,024 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:59,024 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 13:12:59,024 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:59,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-08 13:12:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:59,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176037710] [2022-04-08 13:12:59,025 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:59,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-08 13:12:59,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:59,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446989358] [2022-04-08 13:12:59,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:59,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:59,034 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:59,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1175222828] [2022-04-08 13:12:59,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:59,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:59,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:59,036 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 13:12:59,041 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 13:12:59,074 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:59,074 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:59,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:12:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:59,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:59,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-08 13:12:59,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-08 13:12:59,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:59,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-08 13:12:59,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-08 13:12:59,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:59,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:59,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:59,258 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 13:12:59,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:59,258 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:59,258 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:59,266 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:59,266 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 13:12:59,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:59,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:59,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:59,268 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:59,268 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:59,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:59,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-08 13:12:59,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-08 13:12:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 13:12:59,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446989358] [2022-04-08 13:12:59,285 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:59,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175222828] [2022-04-08 13:12:59,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175222828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:59,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:59,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:59,286 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:59,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176037710] [2022-04-08 13:12:59,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176037710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:59,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:59,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:59,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552246408] [2022-04-08 13:12:59,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:59,287 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 13:12:59,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:59,287 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:59,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:59,298 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:59,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:59,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:59,299 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:59,428 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 13:12:59,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:59,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 13:12:59,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:59,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:59,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-08 13:12:59,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:59,487 INFO L225 Difference]: With dead ends: 65 [2022-04-08 13:12:59,487 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 13:12:59,488 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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 13:12:59,488 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:59,489 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 13:12:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 13:12:59,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:59,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:59,504 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:59,504 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:59,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:59,505 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:59,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:59,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:59,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 13:12:59,506 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 13:12:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:59,508 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:59,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:59,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:59,508 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:59,508 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:59,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:59,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 13:12:59,510 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-08 13:12:59,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:59,510 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 13:12:59,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:59,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 13:12:59,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:59,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:12:59,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:59,559 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:59,581 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 13:12:59,777 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:59,778 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-08 13:12:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [898082832] [2022-04-08 13:12:59,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:59,779 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-08 13:12:59,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:59,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597873856] [2022-04-08 13:12:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:59,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:59,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1242172817] [2022-04-08 13:12:59,794 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:59,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:59,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:59,797 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 13:12:59,798 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 13:12:59,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:59,829 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:59,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:59,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:59,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-08 13:12:59,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:59,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:59,972 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:59,972 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:59,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:59,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,974 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,975 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,976 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,977 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,977 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,978 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,979 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,979 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:59,980 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-08 13:12:59,980 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1411#false} is VALID [2022-04-08 13:12:59,980 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-08 13:12:59,980 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-08 13:12:59,980 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-08 13:12:59,981 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-08 13:12:59,981 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 13:12:59,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:59,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597873856] [2022-04-08 13:12:59,981 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:59,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242172817] [2022-04-08 13:12:59,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242172817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:59,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:59,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:59,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [898082832] [2022-04-08 13:12:59,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [898082832] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:59,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:59,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:59,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655899842] [2022-04-08 13:12:59,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:59,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 30 [2022-04-08 13:12:59,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:59,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 13:12:59,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:59,997 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:59,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:59,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:59,997 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 13:13:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,084 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-08 13:13:00,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:13:00,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 30 [2022-04-08 13:13:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:00,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 13:13:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:13:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 13:13:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:13:00,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 13:13:00,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:00,122 INFO L225 Difference]: With dead ends: 70 [2022-04-08 13:13:00,122 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 13:13:00,123 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:13:00,123 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:00,123 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:00,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 13:13:00,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 13:13:00,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:00,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:13:00,144 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:13:00,145 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:13:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,146 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:13:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:13:00,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:00,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:00,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 13:13:00,147 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 13:13:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,149 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:13:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:13:00,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:00,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:00,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:00,149 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:13:00,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-08 13:13:00,151 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-08 13:13:00,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:00,151 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-08 13:13:00,151 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 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 13:13:00,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-08 13:13:00,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:00,211 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-08 13:13:00,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:13:00,211 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:00,211 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:00,230 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:00,428 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,SelfDestructingSolverStorable5 [2022-04-08 13:13:00,428 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:00,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-08 13:13:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:00,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [173096765] [2022-04-08 13:13:00,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:13:00,429 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-08 13:13:00,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:00,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528824629] [2022-04-08 13:13:00,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:00,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:00,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:00,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034925592] [2022-04-08 13:13:00,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:00,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:00,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:00,441 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 13:13:00,442 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 13:13:00,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:00,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:00,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:13:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:00,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:00,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-08 13:13:00,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-08 13:13:00,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:13:00,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-08 13:13:00,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-08 13:13:00,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,616 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 5);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,616 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:13:00,616 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:13:00,616 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:13:00,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:13:00,617 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:13:00,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:13:00,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:13:00,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:13:00,618 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,618 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:13:00,618 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:13:00,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:13:00,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:13:00,619 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,619 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,620 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,620 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 5);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:13:00,621 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:00,622 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:00,622 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-08 13:13:00,622 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-08 13:13:00,622 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 13:13:00,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:13:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528824629] [2022-04-08 13:13:00,623 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034925592] [2022-04-08 13:13:00,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034925592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:00,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:00,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:13:00,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [173096765] [2022-04-08 13:13:00,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [173096765] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:00,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:00,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:13:00,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527542858] [2022-04-08 13:13:00,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:00,624 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:13:00,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:00,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:00,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:00,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:13:00,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:00,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:13:00,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:13:00,640 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:00,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,824 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 13:13:00,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:13:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:13:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:00,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:13:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:00,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:13:00,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 13:13:00,861 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 13:13:00,862 INFO L225 Difference]: With dead ends: 76 [2022-04-08 13:13:00,863 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 13:13:00,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 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 13:13:00,863 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:00,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:13:00,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 13:13:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-08 13:13:00,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:00,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:00,905 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:00,905 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,908 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:13:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:13:00,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:00,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:00,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-08 13:13:00,909 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-08 13:13:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:00,910 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:13:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:13:00,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:00,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:00,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:00,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:00,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-08 13:13:00,915 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-08 13:13:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:00,915 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-08 13:13:00,915 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:00,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-08 13:13:00,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-08 13:13:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 13:13:00,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:00,971 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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 13:13:00,990 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 13:13:01,183 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:01,183 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:01,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-08 13:13:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:01,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1142400925] [2022-04-08 13:13:05,308 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:05,308 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:05,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-08 13:13:05,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:05,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358554753] [2022-04-08 13:13:05,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:05,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:05,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:05,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [784862922] [2022-04-08 13:13:05,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:05,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:05,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:05,326 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 13:13:05,327 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 13:13:05,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:05,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:05,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:13:05,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:05,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:05,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:13:05,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:05,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:05,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:05,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:05,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:05,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,503 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,504 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,504 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,505 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,505 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,506 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,507 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,507 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,508 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,509 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:05,509 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-08 13:13:05,509 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 5);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:13:05,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 5);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:13:05,510 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:13:05,511 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 13:13:05,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:05,660 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:13:05,660 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:13:05,660 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:13:05,660 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:13:05,660 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:13:05,660 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:13:05,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:13:05,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:13:05,661 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:13:05,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 5);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:13:05,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:13:05,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:13:05,676 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 5)} is VALID [2022-04-08 13:13:05,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,677 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #82#return; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,677 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:13:05,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:13:05,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:13:05,678 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:13:05,678 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #80#return; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:13:05,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:13:05,678 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:13:05,679 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:13:05,679 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 5)} #78#return; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,679 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:13:05,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:13:05,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:13:05,679 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:13:05,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 5)} is VALID [2022-04-08 13:13:05,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 4)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2604#(< ~counter~0 4)} is VALID [2022-04-08 13:13:05,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 4)} call #t~ret7 := main(); {2604#(< ~counter~0 4)} is VALID [2022-04-08 13:13:05,682 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 4)} {2396#true} #92#return; {2604#(< ~counter~0 4)} is VALID [2022-04-08 13:13:05,682 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 4)} assume true; {2604#(< ~counter~0 4)} is VALID [2022-04-08 13:13:05,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2604#(< ~counter~0 4)} is VALID [2022-04-08 13:13:05,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:13:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 13:13:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:05,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358554753] [2022-04-08 13:13:05,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:05,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784862922] [2022-04-08 13:13:05,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784862922] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:05,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:05,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 13:13:05,685 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:05,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1142400925] [2022-04-08 13:13:05,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1142400925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:05,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:05,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:13:05,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145385981] [2022-04-08 13:13:05,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:05,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-08 13:13:05,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:05,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:13:05,704 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:05,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:13:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:05,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:13:05,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:13:05,705 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:13:05,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:05,826 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-08 13:13:05,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:13:05,826 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-08 13:13:05,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:13:05,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:13:05,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:13:05,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:13:05,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-08 13:13:05,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:05,875 INFO L225 Difference]: With dead ends: 90 [2022-04-08 13:13:05,875 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 13:13:05,876 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:13:05,876 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:05,876 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:05,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 13:13:05,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 13:13:05,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:05,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:05,913 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:05,913 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:05,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:05,915 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:13:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:13:05,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:05,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:05,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-08 13:13:05,916 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-08 13:13:05,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:05,918 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:13:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:13:05,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:05,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:05,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:05,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:05,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:13:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-08 13:13:05,920 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-08 13:13:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:05,920 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-08 13:13:05,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:13:05,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-08 13:13:05,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:05,980 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:13:05,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 13:13:05,981 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:05,981 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:06,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-08 13:13:06,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:06,200 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:06,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:06,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-08 13:13:06,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:06,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1337156096] [2022-04-08 13:13:10,003 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:10,003 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:10,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-08 13:13:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039728697] [2022-04-08 13:13:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:10,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:10,023 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:10,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1820882550] [2022-04-08 13:13:10,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:10,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:10,024 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 13:13:10,026 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 13:13:10,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:10,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:10,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:13:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:10,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:10,246 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:13:10,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-08 13:13:10,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:13:10,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:13:10,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,248 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,249 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,249 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,255 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,255 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,255 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:10,256 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:13:10,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:13:10,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:13:10,257 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,258 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:13:10,258 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,259 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:13:10,259 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:10,259 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:10,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:13:10,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:13:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 13:13:10,260 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:10,424 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:13:10,425 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:13:10,425 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:10,425 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:10,428 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,428 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,428 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,428 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,429 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,432 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,432 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,433 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,433 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,434 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:13:10,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:13:10,434 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:13:10,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 5);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:13:10,435 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:13:10,435 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:13:10,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:13:10,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-08 13:13:10,436 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:13:10,436 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 13:13:10,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:10,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039728697] [2022-04-08 13:13:10,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:10,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1820882550] [2022-04-08 13:13:10,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1820882550] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 13:13:10,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:13:10,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 13:13:10,437 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:10,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1337156096] [2022-04-08 13:13:10,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1337156096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:10,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:10,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:13:10,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966998761] [2022-04-08 13:13:10,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:10,437 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), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-08 13:13:10,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:10,438 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:10,452 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 13:13:10,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:13:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:13:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:13:10,452 INFO L87 Difference]: Start difference. First operand 65 states and 78 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:12,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,626 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 13:13:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:13:12,626 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), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-08 13:13:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:12,626 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:12,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:13:12,627 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:13:12,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 13:13:12,664 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 13:13:12,665 INFO L225 Difference]: With dead ends: 78 [2022-04-08 13:13:12,666 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 13:13:12,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:13:12,666 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:12,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 13:13:12,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-08 13:13:12,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:12,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:13:12,699 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:13:12,700 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:13:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,702 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:13:12,702 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:13:12,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:12,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:12,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 13:13:12,703 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 13:13:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:12,705 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:13:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:13:12,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:12,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:12,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:12,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:13:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-08 13:13:12,707 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-08 13:13:12,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:12,708 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-08 13:13:12,708 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), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:13:12,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-08 13:13:12,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-08 13:13:12,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 13:13:12,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:12,798 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:12,814 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 13:13:13,011 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:13,011 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:13,012 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-08 13:13:13,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:13,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [111589488] [2022-04-08 13:13:17,114 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:17,114 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:17,114 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-08 13:13:17,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:17,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676296014] [2022-04-08 13:13:17,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:17,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:17,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:17,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1051044051] [2022-04-08 13:13:17,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:17,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:17,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:17,123 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 13:13:17,124 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 13:13:17,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:17,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:17,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:13:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:17,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:17,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:13:17,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:17,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:17,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:17,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:17,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:17,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,396 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,397 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,397 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,398 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,399 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,399 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,400 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,400 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,402 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:17,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,403 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,405 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,405 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,406 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,407 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,407 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,411 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,412 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,412 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-08 13:13:17,412 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:13:17,412 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:13:17,412 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:13:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 13:13:17,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:17,626 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:13:17,626 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:13:17,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:13:17,627 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:13:17,627 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:13:17,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,627 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:13:17,628 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 5)} is VALID [2022-04-08 13:13:17,628 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 5)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,629 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #82#return; {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,629 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,630 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #80#return; {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,630 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,630 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,630 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,630 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,630 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 5)} #78#return; {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,631 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,631 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,631 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 5)} is VALID [2022-04-08 13:13:17,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #82#return; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #80#return; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,633 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,633 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,634 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 4)} #78#return; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,634 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:13:17,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:13:17,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:13:17,634 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:13:17,635 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {3848#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 4)} is VALID [2022-04-08 13:13:17,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {3848#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,636 INFO L272 TraceCheckUtils]: 4: Hoare triple {3848#(<= ~counter~0 2)} call #t~ret7 := main(); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,636 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3848#(<= ~counter~0 2)} {3769#true} #92#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,636 INFO L290 TraceCheckUtils]: 2: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:17,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:13:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 13:13:17,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:17,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676296014] [2022-04-08 13:13:17,637 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:17,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051044051] [2022-04-08 13:13:17,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051044051] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:17,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 13:13:17,638 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:17,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [111589488] [2022-04-08 13:13:17,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [111589488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:17,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:17,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:13:17,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038595811] [2022-04-08 13:13:17,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:17,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-08 13:13:17,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:17,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:17,670 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 13:13:17,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:13:17,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:17,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:13:17,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:13:17,670 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:17,838 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-08 13:13:17,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:13:17,838 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-08 13:13:17,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:17,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:13:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:17,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:13:17,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-08 13:13:17,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:17,888 INFO L225 Difference]: With dead ends: 104 [2022-04-08 13:13:17,888 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 13:13:17,888 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:13:17,889 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:17,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:17,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 13:13:17,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-08 13:13:17,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:17,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:17,942 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:17,942 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:17,945 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:13:17,945 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:13:17,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:17,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:17,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-08 13:13:17,945 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-08 13:13:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:17,947 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:13:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:13:17,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:17,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:17,948 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:17,948 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:17,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:17,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-08 13:13:17,950 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-08 13:13:17,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:17,950 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-08 13:13:17,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:17,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-08 13:13:18,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:18,066 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-08 13:13:18,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 13:13:18,067 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:18,067 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:18,085 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 13:13:18,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:18,268 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:18,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:18,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-08 13:13:18,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:18,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1070908112] [2022-04-08 13:13:22,357 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:22,357 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:22,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-08 13:13:22,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:22,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749478357] [2022-04-08 13:13:22,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:22,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:22,365 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:22,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [783018288] [2022-04-08 13:13:22,365 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:13:22,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:22,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:22,366 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 13:13:22,371 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 13:13:22,405 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:13:22,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:22,406 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:13:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:22,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:22,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {4669#true} call ULTIMATE.init(); {4669#true} is VALID [2022-04-08 13:13:22,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {4669#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4677#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:22,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {4677#(<= ~counter~0 0)} assume true; {4677#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:22,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4677#(<= ~counter~0 0)} {4669#true} #92#return; {4677#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:22,626 INFO L272 TraceCheckUtils]: 4: Hoare triple {4677#(<= ~counter~0 0)} call #t~ret7 := main(); {4677#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:22,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {4677#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4677#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:22,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {4677#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {4693#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,627 INFO L272 TraceCheckUtils]: 8: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,628 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #78#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,629 INFO L272 TraceCheckUtils]: 13: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,630 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #80#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,630 INFO L272 TraceCheckUtils]: 18: Hoare triple {4693#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {4693#(<= ~counter~0 1)} ~cond := #in~cond; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {4693#(<= ~counter~0 1)} assume !(0 == ~cond); {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {4693#(<= ~counter~0 1)} assume true; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4693#(<= ~counter~0 1)} {4693#(<= ~counter~0 1)} #82#return; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {4693#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4693#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:22,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {4693#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {4748#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,633 INFO L272 TraceCheckUtils]: 26: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,635 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #78#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,635 INFO L272 TraceCheckUtils]: 31: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,635 INFO L290 TraceCheckUtils]: 32: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,636 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #80#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,637 INFO L272 TraceCheckUtils]: 36: Hoare triple {4748#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,637 INFO L290 TraceCheckUtils]: 37: Hoare triple {4748#(<= ~counter~0 2)} ~cond := #in~cond; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {4748#(<= ~counter~0 2)} assume !(0 == ~cond); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,638 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4748#(<= ~counter~0 2)} {4748#(<= ~counter~0 2)} #82#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,638 INFO L290 TraceCheckUtils]: 41: Hoare triple {4748#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,638 INFO L290 TraceCheckUtils]: 42: Hoare triple {4748#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4803#(<= |main_#t~post5| 2)} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 43: Hoare triple {4803#(<= |main_#t~post5| 2)} assume !(#t~post5 < 5);havoc #t~post5; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {4670#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {4670#false} assume !(#t~post6 < 5);havoc #t~post6; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L272 TraceCheckUtils]: 46: Hoare triple {4670#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#false} assume !(0 == ~cond); {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#false} assume true; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#false} {4670#false} #88#return; {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {4670#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4670#false} is VALID [2022-04-08 13:13:22,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-08 13:13:22,640 INFO L290 TraceCheckUtils]: 53: Hoare triple {4670#false} assume 0 == ~cond; {4670#false} is VALID [2022-04-08 13:13:22,640 INFO L290 TraceCheckUtils]: 54: Hoare triple {4670#false} assume !false; {4670#false} is VALID [2022-04-08 13:13:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 13:13:22,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:22,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {4670#false} assume !false; {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 53: Hoare triple {4670#false} assume 0 == ~cond; {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 52: Hoare triple {4670#false} ~cond := #in~cond; {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L272 TraceCheckUtils]: 51: Hoare triple {4670#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4669#true} {4670#false} #88#return; {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 49: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 48: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,858 INFO L272 TraceCheckUtils]: 46: Hoare triple {4670#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {4670#false} assume !(#t~post6 < 5);havoc #t~post6; {4670#false} is VALID [2022-04-08 13:13:22,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {4670#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4670#false} is VALID [2022-04-08 13:13:22,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {4873#(< |main_#t~post5| 5)} assume !(#t~post5 < 5);havoc #t~post5; {4670#false} is VALID [2022-04-08 13:13:22,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {4877#(< ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4873#(< |main_#t~post5| 5)} is VALID [2022-04-08 13:13:22,859 INFO L290 TraceCheckUtils]: 41: Hoare triple {4877#(< ~counter~0 5)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,860 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #82#return; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,860 INFO L290 TraceCheckUtils]: 39: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,860 INFO L290 TraceCheckUtils]: 38: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,860 INFO L290 TraceCheckUtils]: 37: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,860 INFO L272 TraceCheckUtils]: 36: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,860 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #80#return; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L290 TraceCheckUtils]: 33: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L272 TraceCheckUtils]: 31: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4669#true} {4877#(< ~counter~0 5)} #78#return; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,861 INFO L290 TraceCheckUtils]: 29: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,861 INFO L272 TraceCheckUtils]: 26: Hoare triple {4877#(< ~counter~0 5)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {4877#(< ~counter~0 5)} assume !!(#t~post5 < 5);havoc #t~post5; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,864 INFO L290 TraceCheckUtils]: 24: Hoare triple {4932#(< ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4877#(< ~counter~0 5)} is VALID [2022-04-08 13:13:22,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {4932#(< ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,864 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #82#return; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,865 INFO L272 TraceCheckUtils]: 18: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,865 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #80#return; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L272 TraceCheckUtils]: 13: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4669#true} {4932#(< ~counter~0 4)} #78#return; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {4669#true} assume true; {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {4669#true} assume !(0 == ~cond); {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {4669#true} ~cond := #in~cond; {4669#true} is VALID [2022-04-08 13:13:22,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {4932#(< ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4669#true} is VALID [2022-04-08 13:13:22,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {4932#(< ~counter~0 4)} assume !!(#t~post5 < 5);havoc #t~post5; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {4748#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4932#(< ~counter~0 4)} is VALID [2022-04-08 13:13:22,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {4748#(<= ~counter~0 2)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {4748#(<= ~counter~0 2)} call #t~ret7 := main(); {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4748#(<= ~counter~0 2)} {4669#true} #92#return; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4748#(<= ~counter~0 2)} assume true; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4669#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4748#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:22,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4669#true} call ULTIMATE.init(); {4669#true} is VALID [2022-04-08 13:13:22,869 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 13:13:22,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:22,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749478357] [2022-04-08 13:13:22,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:22,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783018288] [2022-04-08 13:13:22,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783018288] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:22,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:22,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-08 13:13:22,870 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:22,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1070908112] [2022-04-08 13:13:22,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1070908112] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:22,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:22,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:13:22,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730865180] [2022-04-08 13:13:22,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:22,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-08 13:13:22,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:22,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:22,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:22,911 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:13:22,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:13:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:13:22,911 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:23,075 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-08 13:13:23,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:13:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-08 13:13:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:13:23,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:23,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:13:23,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 13:13:23,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:23,132 INFO L225 Difference]: With dead ends: 126 [2022-04-08 13:13:23,132 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 13:13:23,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-08 13:13:23,133 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:23,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:23,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 13:13:23,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 13:13:23,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:23,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:23,195 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:23,196 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:23,197 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:13:23,197 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:23,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:23,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:23,198 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 13:13:23,198 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 13:13:23,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:23,199 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:13:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:23,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:23,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:23,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:23,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:23,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:13:23,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-08 13:13:23,202 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-08 13:13:23,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:23,202 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-08 13:13:23,202 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:13:23,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-08 13:13:23,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:23,311 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:13:23,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:13:23,311 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:23,311 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:23,327 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 13:13:23,512 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:23,514 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:23,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-08 13:13:23,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:23,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100684647] [2022-04-08 13:13:25,591 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:25,592 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:25,592 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-08 13:13:25,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:25,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10841396] [2022-04-08 13:13:25,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:25,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:25,603 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:25,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [583059149] [2022-04-08 13:13:25,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:25,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:25,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:25,620 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 13:13:25,621 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 13:13:25,663 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:25,663 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:25,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:13:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:25,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:25,926 INFO L272 TraceCheckUtils]: 0: Hoare triple {5635#true} call ULTIMATE.init(); {5635#true} is VALID [2022-04-08 13:13:25,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {5635#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5643#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:25,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {5643#(<= ~counter~0 0)} assume true; {5643#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:25,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5643#(<= ~counter~0 0)} {5635#true} #92#return; {5643#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:25,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {5643#(<= ~counter~0 0)} call #t~ret7 := main(); {5643#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:25,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {5643#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5643#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:25,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {5643#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {5659#(<= ~counter~0 1)} assume !!(#t~post5 < 5);havoc #t~post5; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,938 INFO L272 TraceCheckUtils]: 8: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,939 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #78#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,940 INFO L272 TraceCheckUtils]: 13: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,941 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #80#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,941 INFO L272 TraceCheckUtils]: 18: Hoare triple {5659#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {5659#(<= ~counter~0 1)} ~cond := #in~cond; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,942 INFO L290 TraceCheckUtils]: 20: Hoare triple {5659#(<= ~counter~0 1)} assume !(0 == ~cond); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,942 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5659#(<= ~counter~0 1)} {5659#(<= ~counter~0 1)} #82#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {5659#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:25,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {5659#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,943 INFO L290 TraceCheckUtils]: 25: Hoare triple {5714#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,944 INFO L272 TraceCheckUtils]: 26: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,948 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #78#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,948 INFO L272 TraceCheckUtils]: 31: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,949 INFO L290 TraceCheckUtils]: 33: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,950 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #80#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,950 INFO L272 TraceCheckUtils]: 36: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {5714#(<= ~counter~0 2)} ~cond := #in~cond; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {5714#(<= ~counter~0 2)} assume !(0 == ~cond); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {5714#(<= ~counter~0 2)} assume true; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,951 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5714#(<= ~counter~0 2)} {5714#(<= ~counter~0 2)} #82#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,952 INFO L290 TraceCheckUtils]: 41: Hoare triple {5714#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:25,952 INFO L290 TraceCheckUtils]: 42: Hoare triple {5714#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,952 INFO L290 TraceCheckUtils]: 43: Hoare triple {5769#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,953 INFO L272 TraceCheckUtils]: 44: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,953 INFO L290 TraceCheckUtils]: 45: Hoare triple {5769#(<= ~counter~0 3)} ~cond := #in~cond; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,953 INFO L290 TraceCheckUtils]: 46: Hoare triple {5769#(<= ~counter~0 3)} assume !(0 == ~cond); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,954 INFO L290 TraceCheckUtils]: 47: Hoare triple {5769#(<= ~counter~0 3)} assume true; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,954 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5769#(<= ~counter~0 3)} {5769#(<= ~counter~0 3)} #84#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,955 INFO L272 TraceCheckUtils]: 49: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,955 INFO L290 TraceCheckUtils]: 50: Hoare triple {5769#(<= ~counter~0 3)} ~cond := #in~cond; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,955 INFO L290 TraceCheckUtils]: 51: Hoare triple {5769#(<= ~counter~0 3)} assume !(0 == ~cond); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,955 INFO L290 TraceCheckUtils]: 52: Hoare triple {5769#(<= ~counter~0 3)} assume true; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,956 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5769#(<= ~counter~0 3)} {5769#(<= ~counter~0 3)} #86#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,956 INFO L290 TraceCheckUtils]: 54: Hoare triple {5769#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {5769#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:25,958 INFO L290 TraceCheckUtils]: 56: Hoare triple {5769#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5812#(<= |main_#t~post6| 3)} is VALID [2022-04-08 13:13:25,958 INFO L290 TraceCheckUtils]: 57: Hoare triple {5812#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {5636#false} is VALID [2022-04-08 13:13:25,958 INFO L272 TraceCheckUtils]: 58: Hoare triple {5636#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5636#false} is VALID [2022-04-08 13:13:25,958 INFO L290 TraceCheckUtils]: 59: Hoare triple {5636#false} ~cond := #in~cond; {5636#false} is VALID [2022-04-08 13:13:25,958 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#false} assume 0 == ~cond; {5636#false} is VALID [2022-04-08 13:13:25,958 INFO L290 TraceCheckUtils]: 61: Hoare triple {5636#false} assume !false; {5636#false} is VALID [2022-04-08 13:13:25,959 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 13:13:25,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:26,200 INFO L290 TraceCheckUtils]: 61: Hoare triple {5636#false} assume !false; {5636#false} is VALID [2022-04-08 13:13:26,200 INFO L290 TraceCheckUtils]: 60: Hoare triple {5636#false} assume 0 == ~cond; {5636#false} is VALID [2022-04-08 13:13:26,200 INFO L290 TraceCheckUtils]: 59: Hoare triple {5636#false} ~cond := #in~cond; {5636#false} is VALID [2022-04-08 13:13:26,200 INFO L272 TraceCheckUtils]: 58: Hoare triple {5636#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5636#false} is VALID [2022-04-08 13:13:26,201 INFO L290 TraceCheckUtils]: 57: Hoare triple {5840#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {5636#false} is VALID [2022-04-08 13:13:26,201 INFO L290 TraceCheckUtils]: 56: Hoare triple {5844#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5840#(< |main_#t~post6| 5)} is VALID [2022-04-08 13:13:26,201 INFO L290 TraceCheckUtils]: 55: Hoare triple {5844#(< ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {5844#(< ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,202 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5635#true} {5844#(< ~counter~0 5)} #86#return; {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,203 INFO L290 TraceCheckUtils]: 51: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,203 INFO L290 TraceCheckUtils]: 50: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,203 INFO L272 TraceCheckUtils]: 49: Hoare triple {5844#(< ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,203 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5635#true} {5844#(< ~counter~0 5)} #84#return; {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,203 INFO L290 TraceCheckUtils]: 47: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,203 INFO L290 TraceCheckUtils]: 46: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,204 INFO L272 TraceCheckUtils]: 44: Hoare triple {5844#(< ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {5844#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {5769#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5844#(< ~counter~0 5)} is VALID [2022-04-08 13:13:26,205 INFO L290 TraceCheckUtils]: 41: Hoare triple {5769#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,205 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #82#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,205 INFO L290 TraceCheckUtils]: 39: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L290 TraceCheckUtils]: 38: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L290 TraceCheckUtils]: 37: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L272 TraceCheckUtils]: 36: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #80#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,206 INFO L290 TraceCheckUtils]: 34: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L290 TraceCheckUtils]: 33: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L290 TraceCheckUtils]: 32: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,206 INFO L272 TraceCheckUtils]: 31: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,207 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5635#true} {5769#(<= ~counter~0 3)} #78#return; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,207 INFO L272 TraceCheckUtils]: 26: Hoare triple {5769#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {5769#(<= ~counter~0 3)} assume !!(#t~post5 < 5);havoc #t~post5; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {5714#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5769#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:26,208 INFO L290 TraceCheckUtils]: 23: Hoare triple {5714#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,209 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #82#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,209 INFO L272 TraceCheckUtils]: 18: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #80#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 15: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L272 TraceCheckUtils]: 13: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5635#true} {5714#(<= ~counter~0 2)} #78#return; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {5635#true} assume true; {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 10: Hoare triple {5635#true} assume !(0 == ~cond); {5635#true} is VALID [2022-04-08 13:13:26,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {5635#true} ~cond := #in~cond; {5635#true} is VALID [2022-04-08 13:13:26,211 INFO L272 TraceCheckUtils]: 8: Hoare triple {5714#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5635#true} is VALID [2022-04-08 13:13:26,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {5714#(<= ~counter~0 2)} assume !!(#t~post5 < 5);havoc #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {5659#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5714#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:26,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {5659#(<= ~counter~0 1)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:26,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {5659#(<= ~counter~0 1)} call #t~ret7 := main(); {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:26,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5659#(<= ~counter~0 1)} {5635#true} #92#return; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:26,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {5659#(<= ~counter~0 1)} assume true; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:26,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {5635#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5659#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:26,213 INFO L272 TraceCheckUtils]: 0: Hoare triple {5635#true} call ULTIMATE.init(); {5635#true} is VALID [2022-04-08 13:13:26,213 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:13:26,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:26,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10841396] [2022-04-08 13:13:26,214 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:26,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583059149] [2022-04-08 13:13:26,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583059149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:26,214 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:26,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-08 13:13:26,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:26,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100684647] [2022-04-08 13:13:26,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100684647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:26,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:26,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:13:26,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114155923] [2022-04-08 13:13:26,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:26,215 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-08 13:13:26,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:26,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:13:26,249 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 13:13:26,249 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:13:26,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:13:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:13:26,250 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:13:26,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:26,520 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-08 13:13:26,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:13:26,520 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-08 13:13:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:13:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:13:26,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:13:26,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:13:26,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 13:13:26,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:26,586 INFO L225 Difference]: With dead ends: 145 [2022-04-08 13:13:26,587 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 13:13:26,587 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:13:26,588 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 25 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:26,588 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 173 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:13:26,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 13:13:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-08 13:13:26,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:26,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:13:26,682 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:13:26,682 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:13:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:26,685 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:13:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:13:26,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:26,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:26,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-08 13:13:26,685 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-08 13:13:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:26,687 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:13:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:13:26,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:26,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:26,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:26,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:13:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-08 13:13:26,690 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-08 13:13:26,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:26,690 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-08 13:13:26,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:13:26,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-08 13:13:26,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:26,815 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-08 13:13:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:13:26,815 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:26,815 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:26,833 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 13:13:27,016 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,SelfDestructingSolverStorable11 [2022-04-08 13:13:27,016 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:27,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:27,016 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-08 13:13:27,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:27,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1950513226] [2022-04-08 13:13:31,112 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:31,112 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:31,112 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-08 13:13:31,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:31,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458159979] [2022-04-08 13:13:31,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:31,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:31,123 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:31,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2145386486] [2022-04-08 13:13:31,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:31,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:31,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:31,124 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 13:13:31,125 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 13:13:31,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:31,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:31,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 13:13:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:31,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:31,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-08 13:13:31,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6821#true} is VALID [2022-04-08 13:13:31,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,586 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #92#return; {6821#true} is VALID [2022-04-08 13:13:31,586 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret7 := main(); {6821#true} is VALID [2022-04-08 13:13:31,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,590 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,590 INFO L272 TraceCheckUtils]: 13: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,591 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6821#true} {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,593 INFO L290 TraceCheckUtils]: 28: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,594 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,594 INFO L272 TraceCheckUtils]: 31: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,595 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,595 INFO L272 TraceCheckUtils]: 36: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,595 INFO L290 TraceCheckUtils]: 39: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,595 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,596 INFO L290 TraceCheckUtils]: 41: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,596 INFO L290 TraceCheckUtils]: 42: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,597 INFO L272 TraceCheckUtils]: 44: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,597 INFO L290 TraceCheckUtils]: 45: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,597 INFO L290 TraceCheckUtils]: 46: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,597 INFO L290 TraceCheckUtils]: 47: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,598 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,598 INFO L272 TraceCheckUtils]: 49: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:31,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:31,598 INFO L290 TraceCheckUtils]: 51: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:31,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:31,598 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6821#true} {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:31,599 INFO L290 TraceCheckUtils]: 54: Hoare triple {6896#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:31,599 INFO L290 TraceCheckUtils]: 55: Hoare triple {6841#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:13:31,600 INFO L290 TraceCheckUtils]: 56: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:13:31,611 INFO L290 TraceCheckUtils]: 57: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:13:31,624 INFO L272 TraceCheckUtils]: 58: Hoare triple {6993#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:31,624 INFO L290 TraceCheckUtils]: 59: Hoare triple {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:31,624 INFO L290 TraceCheckUtils]: 60: Hoare triple {7007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6822#false} is VALID [2022-04-08 13:13:31,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-08 13:13:31,625 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:13:31,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:32,585 INFO L290 TraceCheckUtils]: 61: Hoare triple {6822#false} assume !false; {6822#false} is VALID [2022-04-08 13:13:32,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {7007#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6822#false} is VALID [2022-04-08 13:13:32,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7007#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:32,587 INFO L272 TraceCheckUtils]: 58: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7003#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:32,587 INFO L290 TraceCheckUtils]: 57: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 5);havoc #t~post6; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:13:32,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:13:32,602 INFO L290 TraceCheckUtils]: 55: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7023#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:13:32,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,619 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,619 INFO L290 TraceCheckUtils]: 51: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,619 INFO L290 TraceCheckUtils]: 50: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,619 INFO L272 TraceCheckUtils]: 49: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,620 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,620 INFO L290 TraceCheckUtils]: 47: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,620 INFO L290 TraceCheckUtils]: 46: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,620 INFO L290 TraceCheckUtils]: 45: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,620 INFO L272 TraceCheckUtils]: 44: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,622 INFO L290 TraceCheckUtils]: 43: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 5);havoc #t~post6; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,626 INFO L290 TraceCheckUtils]: 41: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,627 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,627 INFO L272 TraceCheckUtils]: 36: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,629 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,629 INFO L290 TraceCheckUtils]: 34: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,629 INFO L290 TraceCheckUtils]: 33: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,629 INFO L290 TraceCheckUtils]: 32: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,629 INFO L272 TraceCheckUtils]: 31: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,630 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6821#true} {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,630 INFO L290 TraceCheckUtils]: 29: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,630 INFO L290 TraceCheckUtils]: 28: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,630 INFO L290 TraceCheckUtils]: 27: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,630 INFO L272 TraceCheckUtils]: 26: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,631 INFO L290 TraceCheckUtils]: 25: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 5);havoc #t~post5; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,638 INFO L290 TraceCheckUtils]: 23: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7037#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:13:32,639 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,639 INFO L272 TraceCheckUtils]: 18: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,639 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 15: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 14: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L272 TraceCheckUtils]: 13: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6821#true} {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {6821#true} assume !(0 == ~cond); {6821#true} is VALID [2022-04-08 13:13:32,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {6821#true} ~cond := #in~cond; {6821#true} is VALID [2022-04-08 13:13:32,641 INFO L272 TraceCheckUtils]: 8: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6821#true} is VALID [2022-04-08 13:13:32,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 5);havoc #t~post5; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {6821#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7033#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:13:32,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {6821#true} call #t~ret7 := main(); {6821#true} is VALID [2022-04-08 13:13:32,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6821#true} {6821#true} #92#return; {6821#true} is VALID [2022-04-08 13:13:32,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {6821#true} assume true; {6821#true} is VALID [2022-04-08 13:13:32,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {6821#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6821#true} is VALID [2022-04-08 13:13:32,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {6821#true} call ULTIMATE.init(); {6821#true} is VALID [2022-04-08 13:13:32,642 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:13:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458159979] [2022-04-08 13:13:32,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145386486] [2022-04-08 13:13:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145386486] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:32,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 13:13:32,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1950513226] [2022-04-08 13:13:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1950513226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:32,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:13:32,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238668869] [2022-04-08 13:13:32,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:32,644 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 13:13:32,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:32,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:13:32,674 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:32,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:13:32,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:32,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:13:32,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:13:32,675 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:13:33,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:33,219 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-08 13:13:33,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 13:13:33,219 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 13:13:33,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:33,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:13:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:13:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:13:33,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:13:33,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-08 13:13:33,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:33,306 INFO L225 Difference]: With dead ends: 181 [2022-04-08 13:13:33,306 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 13:13:33,307 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 13:13:33,308 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:33,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:13:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 13:13:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 13:13:33,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:33,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:13:33,392 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:13:33,392 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:13:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:33,394 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:13:33,394 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:13:33,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:33,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:33,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-08 13:13:33,395 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-08 13:13:33,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:33,397 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:13:33,397 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:13:33,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:33,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:33,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:33,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:33,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:13:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-08 13:13:33,400 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-08 13:13:33,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:33,400 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-08 13:13:33,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:13:33,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-08 13:13:33,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:33,547 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-08 13:13:33,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 13:13:33,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:33,553 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:33,568 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 13:13:33,753 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,SelfDestructingSolverStorable12 [2022-04-08 13:13:33,753 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:33,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:33,754 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-08 13:13:33,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:33,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1137593115] [2022-04-08 13:13:37,866 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:37,866 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:37,867 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-08 13:13:37,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:37,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912184942] [2022-04-08 13:13:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:37,881 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1837561407] [2022-04-08 13:13:37,881 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:13:37,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:37,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:37,882 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 13:13:37,883 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 13:13:37,932 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:13:37,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:37,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 13:13:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:37,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:43,587 INFO L272 TraceCheckUtils]: 0: Hoare triple {8110#true} call ULTIMATE.init(); {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 1: Hoare triple {8110#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8110#true} {8110#true} #92#return; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {8110#true} call #t~ret7 := main(); {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {8110#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {8110#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {8110#true} assume !!(#t~post5 < 5);havoc #t~post5; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L272 TraceCheckUtils]: 8: Hoare triple {8110#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8110#true} {8110#true} #78#return; {8110#true} is VALID [2022-04-08 13:13:43,588 INFO L272 TraceCheckUtils]: 13: Hoare triple {8110#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:43,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,591 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8110#true} #80#return; {8168#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:13:43,591 INFO L272 TraceCheckUtils]: 18: Hoare triple {8168#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-08 13:13:43,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-08 13:13:43,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,592 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8110#true} {8168#(= main_~A~0 main_~r~0)} #82#return; {8168#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:13:43,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {8168#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 5);havoc #t~post5; {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,593 INFO L272 TraceCheckUtils]: 26: Hoare triple {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:43,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,595 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8187#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,595 INFO L272 TraceCheckUtils]: 31: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-08 13:13:43,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-08 13:13:43,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,596 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8110#true} {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,596 INFO L272 TraceCheckUtils]: 36: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,596 INFO L290 TraceCheckUtils]: 37: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-08 13:13:43,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-08 13:13:43,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,596 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8110#true} {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {8209#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,598 INFO L290 TraceCheckUtils]: 43: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 5);havoc #t~post6; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,598 INFO L272 TraceCheckUtils]: 44: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {8110#true} ~cond := #in~cond; {8110#true} is VALID [2022-04-08 13:13:43,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {8110#true} assume !(0 == ~cond); {8110#true} is VALID [2022-04-08 13:13:43,598 INFO L290 TraceCheckUtils]: 47: Hoare triple {8110#true} assume true; {8110#true} is VALID [2022-04-08 13:13:43,598 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8110#true} {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,598 INFO L272 TraceCheckUtils]: 49: Hoare triple {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:43,599 INFO L290 TraceCheckUtils]: 51: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,599 INFO L290 TraceCheckUtils]: 52: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,600 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8243#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #86#return; {8280#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:13:43,603 INFO L290 TraceCheckUtils]: 54: Hoare triple {8280#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8284#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)) (= main_~q~0 0) (<= (* main_~B~0 main_~p~0) main_~r~0))} is VALID [2022-04-08 13:13:43,604 INFO L290 TraceCheckUtils]: 55: Hoare triple {8284#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (< main_~r~0 (* (* main_~B~0 main_~p~0) 2)) (= main_~q~0 0) (<= (* main_~B~0 main_~p~0) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:13:43,604 INFO L290 TraceCheckUtils]: 56: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:13:43,605 INFO L290 TraceCheckUtils]: 57: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 5);havoc #t~post6; {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:13:43,605 INFO L272 TraceCheckUtils]: 58: Hoare triple {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8110#true} is VALID [2022-04-08 13:13:43,605 INFO L290 TraceCheckUtils]: 59: Hoare triple {8110#true} ~cond := #in~cond; {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:43,605 INFO L290 TraceCheckUtils]: 60: Hoare triple {8157#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,606 INFO L290 TraceCheckUtils]: 61: Hoare triple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:43,606 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8161#(not (= |__VERIFIER_assert_#in~cond| 0))} {8288#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 main_~p~0) main_~d~0) (< main_~A~0 (* (* main_~B~0 main_~p~0) 2)) (<= (* main_~B~0 main_~p~0) main_~A~0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8310#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< 0 (* main_~B~0 main_~p~0)))} is VALID [2022-04-08 13:13:43,607 INFO L272 TraceCheckUtils]: 63: Hoare triple {8310#(and (= (* main_~B~0 main_~p~0) main_~d~0) (< 0 (* main_~B~0 main_~p~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8314#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:43,607 INFO L290 TraceCheckUtils]: 64: Hoare triple {8314#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8318#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:43,607 INFO L290 TraceCheckUtils]: 65: Hoare triple {8318#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8111#false} is VALID [2022-04-08 13:13:43,608 INFO L290 TraceCheckUtils]: 66: Hoare triple {8111#false} assume !false; {8111#false} is VALID [2022-04-08 13:13:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 59 proven. 29 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 13:13:43,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:03,413 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 13:20:35,495 WARN L232 SmtUtils]: Spent 5.58s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-08 13:22:27,482 WARN L855 $PredicateComparison]: unable to prove that (and (not (= |c___VERIFIER_assert_#in~cond| 0)) (or (not (= |c___VERIFIER_assert_#in~cond| 1)) (forall ((aux_mod_v_main_~p~0_BEFORE_CALL_47_34 Int) (aux_div_v_main_~p~0_BEFORE_CALL_47_34 Int)) (or (>= aux_mod_v_main_~p~0_BEFORE_CALL_47_34 2) (> 0 aux_mod_v_main_~p~0_BEFORE_CALL_47_34) (= aux_mod_v_main_~p~0_BEFORE_CALL_47_34 0) (forall ((v_main_~B~0_BEFORE_CALL_45 Int)) (= (let ((.cse0 (+ aux_mod_v_main_~p~0_BEFORE_CALL_47_34 (* aux_div_v_main_~p~0_BEFORE_CALL_47_34 2)))) (mod (* v_main_~B~0_BEFORE_CALL_45 .cse0) .cse0)) 0)) (not (< (+ aux_mod_v_main_~p~0_BEFORE_CALL_47_34 (* aux_div_v_main_~p~0_BEFORE_CALL_47_34 2)) 0)))))) is different from true [2022-04-08 13:26:06,588 WARN L855 $PredicateComparison]: unable to prove that (forall ((main_~p~0 Int) (main_~d~0 Int)) (let ((.cse3 (* main_~d~0 2)) (.cse2 (* main_~p~0 2))) (let ((.cse0 (* (div .cse2 2) (div .cse3 .cse2)))) (let ((.cse1 (+ .cse0 c_main_~r~0 (* (- 1) c_main_~A~0)))) (or (= .cse0 .cse1) (= .cse2 0) (not (<= main_~d~0 c_main_~r~0)) (< .cse2 0) (<= .cse3 c_main_~r~0) (not (= (mod .cse3 .cse2) 0)) (not (= (div .cse3 2) .cse1))))))) is different from true [2022-04-08 13:26:52,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:26:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912184942] [2022-04-08 13:26:52,845 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:26:52,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837561407] [2022-04-08 13:26:52,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837561407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 13:26:52,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:26:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2022-04-08 13:26:52,846 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:26:52,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1137593115] [2022-04-08 13:26:52,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1137593115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:26:52,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:26:52,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 13:26:52,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36582948] [2022-04-08 13:26:52,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:26:52,847 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-08 13:26:52,847 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:26:52,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:26:52,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:52,890 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 13:26:52,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:52,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 13:26:52,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=362, Unknown=2, NotChecked=82, Total=552 [2022-04-08 13:26:52,891 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:26:57,213 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 13:27:04,506 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 13:27:07,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:27:09,946 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 13:27:11,950 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 13:27:14,673 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 13:27:16,676 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 13:27:23,975 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 13:27:25,412 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:27:25,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:25,607 INFO L93 Difference]: Finished difference Result 209 states and 265 transitions. [2022-04-08 13:27:25,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 13:27:25,607 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-08 13:27:25,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:27:25,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:27:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-04-08 13:27:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:27:25,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 150 transitions. [2022-04-08 13:27:25,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 150 transitions. [2022-04-08 13:27:25,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:27:25,785 INFO L225 Difference]: With dead ends: 209 [2022-04-08 13:27:25,785 INFO L226 Difference]: Without dead ends: 184 [2022-04-08 13:27:25,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=162, Invalid=546, Unknown=2, NotChecked=102, Total=812 [2022-04-08 13:27:25,786 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 62 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 75 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.9s IncrementalHoareTripleChecker+Time [2022-04-08 13:27:25,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 192 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 379 Invalid, 7 Unknown, 0 Unchecked, 18.9s Time] [2022-04-08 13:27:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-08 13:27:25,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 169. [2022-04-08 13:27:25,929 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:27:25,929 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 13:27:25,929 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 13:27:25,929 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 13:27:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:25,933 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2022-04-08 13:27:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2022-04-08 13:27:25,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:27:25,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:27:25,934 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) Second operand 184 states. [2022-04-08 13:27:25,934 INFO L87 Difference]: Start difference. First operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) Second operand 184 states. [2022-04-08 13:27:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:27:25,937 INFO L93 Difference]: Finished difference Result 184 states and 226 transitions. [2022-04-08 13:27:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 226 transitions. [2022-04-08 13:27:25,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:27:25,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:27:25,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:27:25,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:27:25,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 110 states have (on average 1.1818181818181819) internal successors, (130), 117 states have internal predecessors, (130), 37 states have call successors, (37), 22 states have call predecessors, (37), 21 states have return successors, (35), 29 states have call predecessors, (35), 35 states have call successors, (35) [2022-04-08 13:27:25,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2022-04-08 13:27:25,942 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 67 [2022-04-08 13:27:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:27:25,942 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2022-04-08 13:27:25,942 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:27:25,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 202 transitions. [2022-04-08 13:27:26,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:27:26,183 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2022-04-08 13:27:26,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 13:27:26,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:27:26,185 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:27:26,202 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 13:27:26,387 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,SelfDestructingSolverStorable13 [2022-04-08 13:27:26,387 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:27:26,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:27:26,388 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-08 13:27:26,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:27:26,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [21318589] [2022-04-08 13:27:29,438 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:27:29,438 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:27:29,439 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-08 13:27:29,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:27:29,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153603474] [2022-04-08 13:27:29,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:27:29,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:27:29,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:27:29,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2090806011] [2022-04-08 13:27:29,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:27:29,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:27:29,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:27:29,448 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 13:27:29,448 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 13:27:29,502 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:27:29,502 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:27:29,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 13:27:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:27:29,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:27:30,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {9606#true} call ULTIMATE.init(); {9606#true} is VALID [2022-04-08 13:27:30,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {9606#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(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9606#true} is VALID [2022-04-08 13:27:30,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9606#true} {9606#true} #92#return; {9606#true} is VALID [2022-04-08 13:27:30,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {9606#true} call #t~ret7 := main(); {9606#true} is VALID [2022-04-08 13:27:30,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {9606#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,103 INFO L272 TraceCheckUtils]: 8: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,103 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9606#true} {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,103 INFO L272 TraceCheckUtils]: 13: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {9606#true} ~cond := #in~cond; {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:27:30,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,105 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,105 INFO L272 TraceCheckUtils]: 18: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,105 INFO L290 TraceCheckUtils]: 20: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,105 INFO L290 TraceCheckUtils]: 21: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,106 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9606#true} {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,106 INFO L290 TraceCheckUtils]: 24: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 5);havoc #t~post5; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,107 INFO L272 TraceCheckUtils]: 26: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,108 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9606#true} {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,108 INFO L272 TraceCheckUtils]: 31: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,108 INFO L290 TraceCheckUtils]: 32: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,108 INFO L290 TraceCheckUtils]: 33: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,108 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9606#true} {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,109 INFO L272 TraceCheckUtils]: 36: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,109 INFO L290 TraceCheckUtils]: 37: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,109 INFO L290 TraceCheckUtils]: 38: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,109 INFO L290 TraceCheckUtils]: 39: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,109 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9606#true} {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,110 INFO L290 TraceCheckUtils]: 41: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,110 INFO L290 TraceCheckUtils]: 42: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,110 INFO L272 TraceCheckUtils]: 44: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L290 TraceCheckUtils]: 45: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L290 TraceCheckUtils]: 46: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L290 TraceCheckUtils]: 47: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9606#true} {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,111 INFO L272 TraceCheckUtils]: 49: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {9606#true} ~cond := #in~cond; {9606#true} is VALID [2022-04-08 13:27:30,111 INFO L290 TraceCheckUtils]: 51: Hoare triple {9606#true} assume !(0 == ~cond); {9606#true} is VALID [2022-04-08 13:27:30,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {9606#true} assume true; {9606#true} is VALID [2022-04-08 13:27:30,112 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9606#true} {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:27:30,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {9683#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {9626#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,113 INFO L290 TraceCheckUtils]: 56: Hoare triple {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,114 INFO L272 TraceCheckUtils]: 58: Hoare triple {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,114 INFO L290 TraceCheckUtils]: 59: Hoare triple {9606#true} ~cond := #in~cond; {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:27:30,114 INFO L290 TraceCheckUtils]: 60: Hoare triple {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,115 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} {9780#(and (<= main_~p~0 main_~q~0) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {9802#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,116 INFO L272 TraceCheckUtils]: 63: Hoare triple {9802#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9606#true} is VALID [2022-04-08 13:27:30,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {9606#true} ~cond := #in~cond; {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:27:30,116 INFO L290 TraceCheckUtils]: 65: Hoare triple {9654#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,116 INFO L290 TraceCheckUtils]: 66: Hoare triple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:27:30,117 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9658#(not (= |__VERIFIER_assert_#in~cond| 0))} {9802#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {9818#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-08 13:27:30,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {9818#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {9822#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-08 13:27:30,119 INFO L272 TraceCheckUtils]: 69: Hoare triple {9822#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9826#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:27:30,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {9826#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9830#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:27:30,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {9830#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9607#false} is VALID [2022-04-08 13:27:30,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {9607#false} assume !false; {9607#false} is VALID [2022-04-08 13:27:30,120 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-08 13:27:30,120 INFO L328 TraceCheckSpWp]: Computing backward predicates...