/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/divbin_unwindbound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:27:12,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:27:12,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:27:12,974 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:27:12,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:27:12,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:27:12,976 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:27:12,978 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:27:12,979 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:27:12,980 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:27:12,980 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:27:12,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:27:12,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:27:12,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:27:12,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:27:12,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:27:12,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:27:12,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:27:12,987 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:27:12,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:27:12,990 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:27:12,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:27:12,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:27:12,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:27:12,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:27:12,995 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:27:12,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:27:12,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:27:12,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:27:12,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:27:12,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:27:12,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:27:12,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:27:12,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:27:12,999 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:27:13,000 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:27:13,000 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:27:13,001 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:27:13,001 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:27:13,001 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:27:13,002 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:27:13,003 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:27:13,004 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:27:13,011 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:27:13,011 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:27:13,012 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:27:13,013 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:27:13,013 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:27:13,013 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:27:13,013 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:27:13,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:27:13,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:27:13,014 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:27:13,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:27:13,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:27:13,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:27:13,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:27:13,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:27:13,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:13,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:27:13,015 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:27:13,016 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:27:13,016 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:27:13,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:27:13,016 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:27:13,016 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-15 14:27:13,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:27:13,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:27:13,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:27:13,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:27:13,324 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:27:13,325 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-15 14:27:13,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7819c66/f0f4e33b98244aed8e7be402787d9959/FLAGd19fbc1ed [2022-04-15 14:27:13,814 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:27:13,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin_unwindbound2.i [2022-04-15 14:27:13,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7819c66/f0f4e33b98244aed8e7be402787d9959/FLAGd19fbc1ed [2022-04-15 14:27:14,207 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf7819c66/f0f4e33b98244aed8e7be402787d9959 [2022-04-15 14:27:14,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:27:14,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:27:14,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:14,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:27:14,220 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:27:14,221 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19c189d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14, skipping insertion in model container [2022-04-15 14:27:14,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,228 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:27:14,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:27:14,397 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/divbin_unwindbound2.i[950,963] [2022-04-15 14:27:14,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:14,447 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:27:14,465 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/divbin_unwindbound2.i[950,963] [2022-04-15 14:27:14,485 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:27:14,496 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:27:14,497 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14 WrapperNode [2022-04-15 14:27:14,497 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:27:14,498 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:27:14,498 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:27:14,498 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:27:14,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:27:14,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:27:14,551 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:27:14,551 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:27:14,552 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (1/1) ... [2022-04-15 14:27:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:27:14,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:14,581 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-15 14:27:14,596 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-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:27:14,621 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:27:14,621 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:27:14,621 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:27:14,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:27:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:27:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:27:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:27:14,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:27:14,680 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:27:14,682 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:27:14,874 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:27:14,880 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:27:14,881 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:27:14,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:14 BoogieIcfgContainer [2022-04-15 14:27:14,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:27:14,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:27:14,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:27:14,887 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:27:14,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:27:14" (1/3) ... [2022-04-15 14:27:14,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b449e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:14, skipping insertion in model container [2022-04-15 14:27:14,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:27:14" (2/3) ... [2022-04-15 14:27:14,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b449e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:27:14, skipping insertion in model container [2022-04-15 14:27:14,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:27:14" (3/3) ... [2022-04-15 14:27:14,889 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin_unwindbound2.i [2022-04-15 14:27:14,893 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:27:14,893 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:27:14,928 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:27:14,933 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-15 14:27:14,934 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:27:14,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 14:27:14,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 14:27:14,972 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:14,973 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:14,973 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:14,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 1 times [2022-04-15 14:27:14,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:14,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1817883931] [2022-04-15 14:27:15,009 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash 878397729, now seen corresponding path program 2 times [2022-04-15 14:27:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:15,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803556080] [2022-04-15 14:27:15,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:15,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:15,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:27:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:15,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(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(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:15,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:15,242 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:27:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:15,250 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:15,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:15,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:15,251 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:27:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:15,258 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:15,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:15,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:15,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:15,260 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:27:15,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(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(9, 2);~counter~0 := 0; {36#true} is VALID [2022-04-15 14:27:15,261 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-15 14:27:15,261 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #89#return; {36#true} is VALID [2022-04-15 14:27:15,261 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret5 := main(); {36#true} is VALID [2022-04-15 14:27:15,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {36#true} is VALID [2022-04-15 14:27:15,262 INFO L272 TraceCheckUtils]: 6: Hoare triple {36#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:15,262 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:15,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:15,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:15,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {37#false} {36#true} #81#return; {37#false} is VALID [2022-04-15 14:27:15,264 INFO L272 TraceCheckUtils]: 11: Hoare triple {37#false} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {36#true} is VALID [2022-04-15 14:27:15,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#true} ~cond := #in~cond; {36#true} is VALID [2022-04-15 14:27:15,264 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#true} assume 0 == ~cond;assume false; {37#false} is VALID [2022-04-15 14:27:15,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#false} assume true; {37#false} is VALID [2022-04-15 14:27:15,265 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {37#false} {37#false} #83#return; {37#false} is VALID [2022-04-15 14:27:15,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {37#false} is VALID [2022-04-15 14:27:15,265 INFO L290 TraceCheckUtils]: 17: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:15,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#false} assume !true; {37#false} is VALID [2022-04-15 14:27:15,266 INFO L272 TraceCheckUtils]: 19: Hoare triple {37#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {37#false} is VALID [2022-04-15 14:27:15,266 INFO L290 TraceCheckUtils]: 20: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2022-04-15 14:27:15,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2022-04-15 14:27:15,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-15 14:27:15,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:15,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:15,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803556080] [2022-04-15 14:27:15,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803556080] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:15,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:15,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:15,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:15,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1817883931] [2022-04-15 14:27:15,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1817883931] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:15,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:15,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:15,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958116332] [2022-04-15 14:27:15,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:15,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:15,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:15,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:15,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:15,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:15,325 INFO L87 Difference]: Start difference. First operand has 33 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:15,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:15,463 INFO L93 Difference]: Finished difference Result 60 states and 84 transitions. [2022-04-15 14:27:15,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:15,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 14:27:15,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:15,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:15,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2022-04-15 14:27:15,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2022-04-15 14:27:15,577 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-15 14:27:15,585 INFO L225 Difference]: With dead ends: 60 [2022-04-15 14:27:15,585 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 14:27:15,588 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:15,591 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:15,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 40 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 14:27:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-04-15 14:27:15,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:15,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:15,623 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:15,627 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:15,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:15,633 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:15,633 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:15,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:15,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:15,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:15,635 INFO L87 Difference]: Start difference. First operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-15 14:27:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:15,639 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-15 14:27:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-15 14:27:15,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:15,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:15,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:15,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:15,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-15 14:27:15,660 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 23 [2022-04-15 14:27:15,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:15,661 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-15 14:27:15,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:15,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-15 14:27:15,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-15 14:27:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 14:27:15,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:15,719 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:15,719 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:27:15,719 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:15,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:15,720 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 1 times [2022-04-15 14:27:15,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:15,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467436955] [2022-04-15 14:27:15,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:15,721 INFO L85 PathProgramCache]: Analyzing trace with hash 994169231, now seen corresponding path program 2 times [2022-04-15 14:27:15,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:15,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049190594] [2022-04-15 14:27:15,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:15,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:15,760 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:15,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301837097] [2022-04-15 14:27:15,761 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:15,763 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-15 14:27:15,775 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-15 14:27:15,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:15,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:15,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:27:15,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:15,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:15,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {286#true} call ULTIMATE.init(); {286#true} is VALID [2022-04-15 14:27:16,001 INFO L290 TraceCheckUtils]: 1: Hoare triple {286#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(9, 2);~counter~0 := 0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {294#(<= ~counter~0 0)} {286#true} #89#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {294#(<= ~counter~0 0)} call #t~ret5 := main(); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,006 INFO L272 TraceCheckUtils]: 6: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,008 INFO L290 TraceCheckUtils]: 9: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,009 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #81#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,010 INFO L272 TraceCheckUtils]: 11: Hoare triple {294#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {294#(<= ~counter~0 0)} ~cond := #in~cond; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {294#(<= ~counter~0 0)} assume !(0 == ~cond); {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(<= ~counter~0 0)} assume true; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,015 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {294#(<= ~counter~0 0)} {294#(<= ~counter~0 0)} #83#return; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {294#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {294#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {294#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {343#(<= |main_#t~post3| 0)} is VALID [2022-04-15 14:27:16,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {343#(<= |main_#t~post3| 0)} assume !(#t~post3 < 2);havoc #t~post3; {287#false} is VALID [2022-04-15 14:27:16,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {287#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {287#false} is VALID [2022-04-15 14:27:16,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {287#false} assume !(#t~post4 < 2);havoc #t~post4; {287#false} is VALID [2022-04-15 14:27:16,018 INFO L272 TraceCheckUtils]: 21: Hoare triple {287#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {287#false} is VALID [2022-04-15 14:27:16,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {287#false} ~cond := #in~cond; {287#false} is VALID [2022-04-15 14:27:16,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {287#false} assume 0 == ~cond; {287#false} is VALID [2022-04-15 14:27:16,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {287#false} assume !false; {287#false} is VALID [2022-04-15 14:27:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:16,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:16,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:16,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049190594] [2022-04-15 14:27:16,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:16,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301837097] [2022-04-15 14:27:16,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301837097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:16,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:16,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:16,021 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:16,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467436955] [2022-04-15 14:27:16,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467436955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:16,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:16,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:27:16,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445091682] [2022-04-15 14:27:16,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:16,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:16,023 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,044 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-15 14:27:16,045 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:27:16,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:16,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:27:16,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:16,046 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,150 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-04-15 14:27:16,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:27:16,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-15 14:27:16,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:16,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:16,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2022-04-15 14:27:16,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2022-04-15 14:27:16,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:16,201 INFO L225 Difference]: With dead ends: 42 [2022-04-15 14:27:16,201 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 14:27:16,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:27:16,203 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:16,204 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:16,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 14:27:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-15 14:27:16,216 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:16,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,217 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,218 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,220 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:16,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:16,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:16,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:16,222 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-15 14:27:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,224 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-04-15 14:27:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:16,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:16,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:16,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:16,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-04-15 14:27:16,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 25 [2022-04-15 14:27:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:16,228 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-04-15 14:27:16,229 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,229 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 36 transitions. [2022-04-15 14:27:16,262 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-15 14:27:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-04-15 14:27:16,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:16,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:16,264 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:16,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:16,479 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:16,480 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 1 times [2022-04-15 14:27:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [445110650] [2022-04-15 14:27:16,481 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:16,481 INFO L85 PathProgramCache]: Analyzing trace with hash 422434646, now seen corresponding path program 2 times [2022-04-15 14:27:16,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:16,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823683789] [2022-04-15 14:27:16,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:16,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:16,507 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:16,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688663917] [2022-04-15 14:27:16,519 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:16,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:16,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:16,521 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-15 14:27:16,523 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-15 14:27:16,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:16,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:16,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:16,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:16,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:16,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 14:27:16,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#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(9, 2);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #89#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret5 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,761 INFO L272 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,763 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #81#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,763 INFO L272 TraceCheckUtils]: 11: Hoare triple {576#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {576#(<= ~counter~0 0)} ~cond := #in~cond; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {576#(<= ~counter~0 0)} assume !(0 == ~cond); {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,765 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {576#(<= ~counter~0 0)} {576#(<= ~counter~0 0)} #83#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {576#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:16,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {576#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:16,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {625#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:16,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {625#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {625#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:16,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {625#(<= ~counter~0 1)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {635#(<= |main_#t~post4| 1)} is VALID [2022-04-15 14:27:16,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {635#(<= |main_#t~post4| 1)} assume !(#t~post4 < 2);havoc #t~post4; {569#false} is VALID [2022-04-15 14:27:16,770 INFO L272 TraceCheckUtils]: 22: Hoare triple {569#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {569#false} is VALID [2022-04-15 14:27:16,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 14:27:16,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 14:27:16,771 INFO L290 TraceCheckUtils]: 25: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 14:27:16,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:16,771 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:16,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:16,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823683789] [2022-04-15 14:27:16,771 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:16,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688663917] [2022-04-15 14:27:16,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688663917] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:16,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:16,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:16,772 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:16,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [445110650] [2022-04-15 14:27:16,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [445110650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:16,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:16,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019349604] [2022-04-15 14:27:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:16,774 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:16,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:16,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:16,796 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:16,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:16,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:16,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:16,797 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,905 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2022-04-15 14:27:16,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:27:16,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2022-04-15 14:27:16,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 14:27:16,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 14:27:16,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:16,958 INFO L225 Difference]: With dead ends: 41 [2022-04-15 14:27:16,958 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 14:27:16,959 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-15 14:27:16,961 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:16,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 14:27:16,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 14:27:16,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:16,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,982 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,982 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,985 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:16,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:16,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:16,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:16,986 INFO L87 Difference]: Start difference. First operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-15 14:27:16,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:16,988 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-15 14:27:16,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-04-15 14:27:16,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:16,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:16,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:16,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:16,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 14:27:16,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-04-15 14:27:16,992 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 26 [2022-04-15 14:27:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:16,992 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-04-15 14:27:16,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 14:27:16,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 40 transitions. [2022-04-15 14:27:17,027 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-15 14:27:17,027 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-04-15 14:27:17,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 14:27:17,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:17,028 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:17,058 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-15 14:27:17,247 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:27:17,248 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:17,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:17,248 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 1 times [2022-04-15 14:27:17,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:17,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1369246355] [2022-04-15 14:27:17,249 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:17,249 INFO L85 PathProgramCache]: Analyzing trace with hash 424222106, now seen corresponding path program 2 times [2022-04-15 14:27:17,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:17,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644061890] [2022-04-15 14:27:17,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:17,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:17,270 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:17,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757697535] [2022-04-15 14:27:17,270 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:17,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:17,272 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-15 14:27:17,289 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-15 14:27:17,332 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:27:17,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:17,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 14:27:17,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:17,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:17,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {866#true} call ULTIMATE.init(); {866#true} is VALID [2022-04-15 14:27:17,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {866#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(9, 2);~counter~0 := 0; {866#true} is VALID [2022-04-15 14:27:17,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:17,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {866#true} {866#true} #89#return; {866#true} is VALID [2022-04-15 14:27:17,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {866#true} call #t~ret5 := main(); {866#true} is VALID [2022-04-15 14:27:17,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {866#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {866#true} is VALID [2022-04-15 14:27:17,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:17,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:17,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:17,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:17,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {866#true} {866#true} #81#return; {866#true} is VALID [2022-04-15 14:27:17,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {866#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {866#true} is VALID [2022-04-15 14:27:17,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {866#true} ~cond := #in~cond; {866#true} is VALID [2022-04-15 14:27:17,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {866#true} assume !(0 == ~cond); {866#true} is VALID [2022-04-15 14:27:17,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {866#true} assume true; {866#true} is VALID [2022-04-15 14:27:17,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {866#true} {866#true} #83#return; {866#true} is VALID [2022-04-15 14:27:17,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {866#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post3 < 2);havoc #t~post3; {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {919#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post4 < 2);havoc #t~post4; {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 14:27:17,866 INFO L272 TraceCheckUtils]: 22: Hoare triple {929#(and (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {939#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 14:27:17,867 INFO L290 TraceCheckUtils]: 23: Hoare triple {939#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {943#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 14:27:17,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {867#false} is VALID [2022-04-15 14:27:17,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {867#false} assume !false; {867#false} is VALID [2022-04-15 14:27:17,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 14:27:17,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:17,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:17,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644061890] [2022-04-15 14:27:17,868 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:17,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757697535] [2022-04-15 14:27:17,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757697535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:17,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:17,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:17,869 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:17,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1369246355] [2022-04-15 14:27:17,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1369246355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:17,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:17,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:17,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174093666] [2022-04-15 14:27:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:17,871 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:17,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:17,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:17,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:17,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:17,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:17,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:27:17,898 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:20,084 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 14:27:20,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:20,313 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-15 14:27:20,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:20,313 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-04-15 14:27:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:20,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:20,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:20,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-15 14:27:20,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-15 14:27:20,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:20,410 INFO L225 Difference]: With dead ends: 50 [2022-04-15 14:27:20,410 INFO L226 Difference]: Without dead ends: 46 [2022-04-15 14:27:20,410 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:27:20,411 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:20,411 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 104 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 14:27:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-15 14:27:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2022-04-15 14:27:20,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:20,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:20,441 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:20,441 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:20,444 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:20,444 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:20,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:20,445 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:20,446 INFO L87 Difference]: Start difference. First operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 46 states. [2022-04-15 14:27:20,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:20,448 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2022-04-15 14:27:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-04-15 14:27:20,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:20,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:20,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:20,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2022-04-15 14:27:20,451 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 26 [2022-04-15 14:27:20,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:20,452 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2022-04-15 14:27:20,452 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-15 14:27:20,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 46 transitions. [2022-04-15 14:27:20,510 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-15 14:27:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2022-04-15 14:27:20,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 14:27:20,512 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:20,512 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:20,540 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-15 14:27:20,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:20,733 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 1 times [2022-04-15 14:27:20,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:20,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1684550486] [2022-04-15 14:27:20,734 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:20,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1733722638, now seen corresponding path program 2 times [2022-04-15 14:27:20,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:20,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944162948] [2022-04-15 14:27:20,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:20,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:20,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:20,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [908512653] [2022-04-15 14:27:20,758 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:20,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:20,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:20,759 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-15 14:27:20,764 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-15 14:27:20,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:20,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:20,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 14:27:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:20,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:20,892 INFO L272 TraceCheckUtils]: 0: Hoare triple {1221#true} call ULTIMATE.init(); {1221#true} is VALID [2022-04-15 14:27:20,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {1221#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(9, 2);~counter~0 := 0; {1221#true} is VALID [2022-04-15 14:27:20,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1221#true} {1221#true} #89#return; {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {1221#true} call #t~ret5 := main(); {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {1221#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L272 TraceCheckUtils]: 6: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:20,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1221#true} {1221#true} #81#return; {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {1221#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:20,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:20,895 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1221#true} {1221#true} #83#return; {1221#true} is VALID [2022-04-15 14:27:20,895 INFO L290 TraceCheckUtils]: 16: Hoare triple {1221#true} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,896 INFO L290 TraceCheckUtils]: 17: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,896 INFO L290 TraceCheckUtils]: 18: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post3 < 2);havoc #t~post3; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,897 INFO L290 TraceCheckUtils]: 19: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {1274#(= main_~B~0 main_~b~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,898 INFO L290 TraceCheckUtils]: 21: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(#t~post4 < 2);havoc #t~post4; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,898 INFO L272 TraceCheckUtils]: 22: Hoare triple {1274#(= main_~B~0 main_~b~0)} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1221#true} is VALID [2022-04-15 14:27:20,898 INFO L290 TraceCheckUtils]: 23: Hoare triple {1221#true} ~cond := #in~cond; {1221#true} is VALID [2022-04-15 14:27:20,898 INFO L290 TraceCheckUtils]: 24: Hoare triple {1221#true} assume !(0 == ~cond); {1221#true} is VALID [2022-04-15 14:27:20,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1221#true} assume true; {1221#true} is VALID [2022-04-15 14:27:20,899 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1221#true} {1274#(= main_~B~0 main_~b~0)} #85#return; {1274#(= main_~B~0 main_~b~0)} is VALID [2022-04-15 14:27:20,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {1274#(= main_~B~0 main_~b~0)} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1222#false} is VALID [2022-04-15 14:27:20,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {1222#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1222#false} is VALID [2022-04-15 14:27:20,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {1222#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1222#false} is VALID [2022-04-15 14:27:20,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {1222#false} assume !(#t~post4 < 2);havoc #t~post4; {1222#false} is VALID [2022-04-15 14:27:20,900 INFO L272 TraceCheckUtils]: 31: Hoare triple {1222#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1222#false} is VALID [2022-04-15 14:27:20,901 INFO L290 TraceCheckUtils]: 32: Hoare triple {1222#false} ~cond := #in~cond; {1222#false} is VALID [2022-04-15 14:27:20,901 INFO L290 TraceCheckUtils]: 33: Hoare triple {1222#false} assume 0 == ~cond; {1222#false} is VALID [2022-04-15 14:27:20,901 INFO L290 TraceCheckUtils]: 34: Hoare triple {1222#false} assume !false; {1222#false} is VALID [2022-04-15 14:27:20,901 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-15 14:27:20,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:20,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944162948] [2022-04-15 14:27:20,902 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:20,902 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908512653] [2022-04-15 14:27:20,902 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908512653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:20,902 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:20,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:20,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:20,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1684550486] [2022-04-15 14:27:20,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1684550486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:20,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:20,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:27:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837372675] [2022-04-15 14:27:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:20,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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 35 [2022-04-15 14:27:20,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:20,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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-15 14:27:20,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:20,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:27:20,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:20,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:27:20,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:27:20,931 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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-15 14:27:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:21,043 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-15 14:27:21,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:27:21,044 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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 35 [2022-04-15 14:27:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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-15 14:27:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:21,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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-15 14:27:21,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-04-15 14:27:21,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-04-15 14:27:21,099 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-15 14:27:21,101 INFO L225 Difference]: With dead ends: 65 [2022-04-15 14:27:21,101 INFO L226 Difference]: Without dead ends: 40 [2022-04-15 14:27:21,101 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-15 14:27:21,102 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:21,102 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:21,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-15 14:27:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-15 14:27:21,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:21,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:21,132 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:21,132 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:21,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:21,136 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:21,136 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:21,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:21,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:21,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:21,141 INFO L87 Difference]: Start difference. First operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-15 14:27:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:21,146 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 14:27:21,147 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:21,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:21,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:21,147 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:21,147 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 47 transitions. [2022-04-15 14:27:21,149 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 47 transitions. Word has length 35 [2022-04-15 14:27:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:21,150 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 47 transitions. [2022-04-15 14:27:21,150 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 3 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-15 14:27:21,150 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 47 transitions. [2022-04-15 14:27:21,205 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-15 14:27:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 47 transitions. [2022-04-15 14:27:21,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 14:27:21,208 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:21,208 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:21,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 14:27:21,431 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:21,432 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:21,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 1 times [2022-04-15 14:27:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:21,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [357736030] [2022-04-15 14:27:21,432 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1874551443, now seen corresponding path program 2 times [2022-04-15 14:27:21,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:21,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916469368] [2022-04-15 14:27:21,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:21,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:21,450 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:21,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [746468913] [2022-04-15 14:27:21,450 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:21,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:21,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:21,452 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-15 14:27:21,462 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-15 14:27:21,503 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:21,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:21,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:27:21,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:21,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:21,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 14:27:21,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,687 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,688 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {1626#(<= ~counter~0 0)} ~cond := #in~cond; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {1626#(<= ~counter~0 0)} assume !(0 == ~cond); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,689 INFO L290 TraceCheckUtils]: 14: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,689 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1626#(<= ~counter~0 0)} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,693 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-15 14:27:21,693 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L290 TraceCheckUtils]: 25: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {1619#false} assume !(0 == ~cond); {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {1619#false} assume true; {1619#false} is VALID [2022-04-15 14:27:21,694 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1619#false} {1619#false} #85#return; {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 14:27:21,696 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 14:27:21,697 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 14:27:21,697 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 14:27:21,697 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 14:27:21,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:27:21,929 INFO L290 TraceCheckUtils]: 36: Hoare triple {1619#false} assume !false; {1619#false} is VALID [2022-04-15 14:27:21,929 INFO L290 TraceCheckUtils]: 35: Hoare triple {1619#false} assume 0 == ~cond; {1619#false} is VALID [2022-04-15 14:27:21,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {1619#false} ~cond := #in~cond; {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L272 TraceCheckUtils]: 33: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {1619#false} assume !(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 31: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 30: Hoare triple {1619#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 29: Hoare triple {1619#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1618#true} {1619#false} #85#return; {1619#false} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 27: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 14:27:21,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 14:27:21,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 14:27:21,931 INFO L272 TraceCheckUtils]: 24: Hoare triple {1619#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1618#true} is VALID [2022-04-15 14:27:21,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1619#false} assume !!(#t~post4 < 2);havoc #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {1619#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {1619#false} is VALID [2022-04-15 14:27:21,934 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#(<= |main_#t~post3| 1)} assume !(#t~post3 < 2);havoc #t~post3; {1619#false} is VALID [2022-04-15 14:27:21,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {1675#(<= ~counter~0 1)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1685#(<= |main_#t~post3| 1)} is VALID [2022-04-15 14:27:21,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {1675#(<= ~counter~0 1)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,938 INFO L290 TraceCheckUtils]: 18: Hoare triple {1675#(<= ~counter~0 1)} assume !!(#t~post3 < 2);havoc #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,938 INFO L290 TraceCheckUtils]: 17: Hoare triple {1626#(<= ~counter~0 0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {1675#(<= ~counter~0 1)} is VALID [2022-04-15 14:27:21,939 INFO L290 TraceCheckUtils]: 16: Hoare triple {1626#(<= ~counter~0 0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,939 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #83#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 14:27:21,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 14:27:21,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 14:27:21,940 INFO L272 TraceCheckUtils]: 11: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1618#true} is VALID [2022-04-15 14:27:21,940 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1618#true} {1626#(<= ~counter~0 0)} #81#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,940 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#true} assume true; {1618#true} is VALID [2022-04-15 14:27:21,940 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#true} assume !(0 == ~cond); {1618#true} is VALID [2022-04-15 14:27:21,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#true} ~cond := #in~cond; {1618#true} is VALID [2022-04-15 14:27:21,941 INFO L272 TraceCheckUtils]: 6: Hoare triple {1626#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {1618#true} is VALID [2022-04-15 14:27:21,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,941 INFO L272 TraceCheckUtils]: 4: Hoare triple {1626#(<= ~counter~0 0)} call #t~ret5 := main(); {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1626#(<= ~counter~0 0)} {1618#true} #89#return; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#(<= ~counter~0 0)} assume true; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {1618#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(9, 2);~counter~0 := 0; {1626#(<= ~counter~0 0)} is VALID [2022-04-15 14:27:21,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {1618#true} call ULTIMATE.init(); {1618#true} is VALID [2022-04-15 14:27:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:27:21,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:21,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916469368] [2022-04-15 14:27:21,944 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:21,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746468913] [2022-04-15 14:27:21,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746468913] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:27:21,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:27:21,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-04-15 14:27:21,944 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:21,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [357736030] [2022-04-15 14:27:21,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [357736030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:21,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:21,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:27:21,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953107467] [2022-04-15 14:27:21,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:21,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:21,946 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:21,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:21,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:21,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:27:21,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:21,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:27:21,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:27:21,976 INFO L87 Difference]: Start difference. First operand 40 states and 47 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:22,130 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-04-15 14:27:22,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:22,130 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 37 [2022-04-15 14:27:22,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:22,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 14:27:22,135 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 14:27:22,181 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-15 14:27:22,182 INFO L225 Difference]: With dead ends: 63 [2022-04-15 14:27:22,182 INFO L226 Difference]: Without dead ends: 42 [2022-04-15 14:27:22,183 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:27:22,183 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:22,184 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:22,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-04-15 14:27:22,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-04-15 14:27:22,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:22,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:22,207 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:22,207 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:22,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:22,209 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:22,209 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:22,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:22,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:22,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:22,210 INFO L87 Difference]: Start difference. First operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 42 states. [2022-04-15 14:27:22,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:22,212 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-04-15 14:27:22,212 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:22,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:22,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:22,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:22,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-15 14:27:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2022-04-15 14:27:22,214 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 37 [2022-04-15 14:27:22,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:22,215 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2022-04-15 14:27:22,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 49 transitions. [2022-04-15 14:27:22,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:22,269 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2022-04-15 14:27:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 14:27:22,270 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:27:22,270 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:27:22,289 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-15 14:27:22,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:22,472 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:27:22,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:27:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 1 times [2022-04-15 14:27:22,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:22,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1768542580] [2022-04-15 14:27:22,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:27:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 815990494, now seen corresponding path program 2 times [2022-04-15 14:27:22,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:27:22,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613217110] [2022-04-15 14:27:22,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:27:22,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:27:22,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:27:22,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [992733975] [2022-04-15 14:27:22,491 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:27:22,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:22,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:27:22,492 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-15 14:27:22,499 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-15 14:27:22,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:27:22,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:27:22,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 14:27:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:27:22,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:27:22,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {2140#true} call ULTIMATE.init(); {2140#true} is VALID [2022-04-15 14:27:22,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {2140#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(9, 2);~counter~0 := 0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2148#(<= 0 ~counter~0)} {2140#true} #89#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {2148#(<= 0 ~counter~0)} call #t~ret5 := main(); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {2148#(<= 0 ~counter~0)} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1;~B~0 := #t~nondet2;havoc #t~nondet2; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 < 2147483647 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,791 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #81#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,792 INFO L272 TraceCheckUtils]: 11: Hoare triple {2148#(<= 0 ~counter~0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {2148#(<= 0 ~counter~0)} ~cond := #in~cond; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {2148#(<= 0 ~counter~0)} assume !(0 == ~cond); {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,793 INFO L290 TraceCheckUtils]: 14: Hoare triple {2148#(<= 0 ~counter~0)} assume true; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2148#(<= 0 ~counter~0)} {2148#(<= 0 ~counter~0)} #83#return; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {2148#(<= 0 ~counter~0)} ~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {2148#(<= 0 ~counter~0)} is VALID [2022-04-15 14:27:22,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {2148#(<= 0 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 14:27:22,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 14:27:22,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {2197#(<= 1 ~counter~0)} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {2197#(<= 1 ~counter~0)} is VALID [2022-04-15 14:27:22,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#(<= 1 ~counter~0)} #t~post3 := ~counter~0;~counter~0 := 1 + #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 14:27:22,797 INFO L290 TraceCheckUtils]: 21: Hoare triple {2207#(<= 2 ~counter~0)} assume !!(#t~post3 < 2);havoc #t~post3; {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 14:27:22,797 INFO L290 TraceCheckUtils]: 22: Hoare triple {2207#(<= 2 ~counter~0)} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {2207#(<= 2 ~counter~0)} is VALID [2022-04-15 14:27:22,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {2207#(<= 2 ~counter~0)} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2217#(<= 2 |main_#t~post4|)} is VALID [2022-04-15 14:27:22,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {2217#(<= 2 |main_#t~post4|)} assume !!(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-15 14:27:22,798 INFO L272 TraceCheckUtils]: 25: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-15 14:27:22,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {2141#false} assume !(0 == ~cond); {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {2141#false} assume true; {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2141#false} {2141#false} #85#return; {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 30: Hoare triple {2141#false} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 31: Hoare triple {2141#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 32: Hoare triple {2141#false} #t~post4 := ~counter~0;~counter~0 := 1 + #t~post4; {2141#false} is VALID [2022-04-15 14:27:22,799 INFO L290 TraceCheckUtils]: 33: Hoare triple {2141#false} assume !(#t~post4 < 2);havoc #t~post4; {2141#false} is VALID [2022-04-15 14:27:22,800 INFO L272 TraceCheckUtils]: 34: Hoare triple {2141#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {2141#false} is VALID [2022-04-15 14:27:22,800 INFO L290 TraceCheckUtils]: 35: Hoare triple {2141#false} ~cond := #in~cond; {2141#false} is VALID [2022-04-15 14:27:22,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {2141#false} assume 0 == ~cond; {2141#false} is VALID [2022-04-15 14:27:22,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {2141#false} assume !false; {2141#false} is VALID [2022-04-15 14:27:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-15 14:27:22,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:27:22,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:27:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613217110] [2022-04-15 14:27:22,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:27:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992733975] [2022-04-15 14:27:22,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992733975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:22,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:22,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:22,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:27:22,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1768542580] [2022-04-15 14:27:22,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1768542580] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:27:22,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:27:22,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:27:22,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687991578] [2022-04-15 14:27:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:27:22,802 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:22,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:27:22,803 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:22,834 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:27:22,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:27:22,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:27:22,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:27:22,835 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:22,966 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2022-04-15 14:27:22,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:27:22,967 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 38 [2022-04-15 14:27:22,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:27:22,967 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 14:27:22,969 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2022-04-15 14:27:22,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2022-04-15 14:27:23,006 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-15 14:27:23,006 INFO L225 Difference]: With dead ends: 44 [2022-04-15 14:27:23,006 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 14:27:23,007 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:27:23,008 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 6 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:27:23,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:27:23,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 14:27:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 14:27:23,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:27:23,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 14:27:23,009 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 14:27:23,009 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 14:27:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:23,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 14:27:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:27:23,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:23,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:23,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 14:27:23,009 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 14:27:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:27:23,009 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 14:27:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:27:23,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:23,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:27:23,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:27:23,010 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:27:23,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 14:27:23,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 14:27:23,010 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2022-04-15 14:27:23,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:27:23,010 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 14:27:23,010 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), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-15 14:27:23,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 14:27:23,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:27:23,011 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 14:27:23,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:27:23,013 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 14:27:23,030 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-15 14:27:23,214 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:27:23,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 14:27:23,786 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-04-15 14:27:23,786 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-04-15 14:27:23,786 INFO L882 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-04-15 14:27:23,786 INFO L885 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: true [2022-04-15 14:27:23,786 INFO L885 garLoopResultBuilder]: At program point L16-2(lines 15 17) the Hoare annotation is: true [2022-04-15 14:27:23,786 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-04-15 14:27:23,787 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 15 17) the Hoare annotation is: true [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,787 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 26 52) the Hoare annotation is: true [2022-04-15 14:27:23,787 INFO L885 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: true [2022-04-15 14:27:23,787 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 26 52) the Hoare annotation is: true [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 49) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (not (<= |old(~counter~0)| 0)) (and (<= 2 ~counter~0) .cse0 .cse1 (<= 2 |main_#t~post4|)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 49) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (= main_~A~0 main_~r~0) (= main_~q~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L36-1(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (<= |main_#t~post3| 0) (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L36-3(lines 36 39) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 0 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (and .cse0 (<= 1 ~counter~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,787 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 26 52) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (and (<= 0 ~counter~0) (<= ~counter~0 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L45(lines 45 48) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L45-2(lines 26 52) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and .cse0 (= main_~B~0 main_~b~0) .cse1) (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L41-1(lines 40 49) the Hoare annotation is: (or (and (= main_~A~0 main_~r~0) (= main_~B~0 main_~b~0) (= main_~q~0 0)) (not (<= |old(~counter~0)| 0)) (not (<= 0 |old(~counter~0)|))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L37(line 37) the Hoare annotation is: (let ((.cse0 (= main_~A~0 main_~r~0)) (.cse1 (= main_~q~0 0))) (or (and (<= 2 ~counter~0) .cse0 .cse1) (not (<= |old(~counter~0)| 0)) (and .cse0 (<= 1 ~counter~0) (= main_~B~0 main_~b~0) .cse1) (not (<= 0 |old(~counter~0)|)))) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 14:27:23,788 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 14:27:23,788 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 ~counter~0) (<= ~counter~0 0)) [2022-04-15 14:27:23,788 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 14:27:23,788 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 14:27:23,789 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 14:27:23,789 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 18 24) the Hoare annotation is: true [2022-04-15 14:27:23,789 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 18 24) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 14:27:23,789 INFO L878 garLoopResultBuilder]: At program point L20(lines 20 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 14:27:23,789 INFO L878 garLoopResultBuilder]: At program point L19(lines 19 22) the Hoare annotation is: (or (not (<= 1 |__VERIFIER_assert_#in~cond|)) (<= 1 __VERIFIER_assert_~cond)) [2022-04-15 14:27:23,789 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 21) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 14:27:23,792 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2] [2022-04-15 14:27:23,793 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 14:27:23,796 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 14:27:23,796 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 14:27:23,799 WARN L170 areAnnotationChecker]: L12-1 has no Hoare annotation [2022-04-15 14:27:23,829 INFO L163 areAnnotationChecker]: CFG has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 14:27:23,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:27:23 BoogieIcfgContainer [2022-04-15 14:27:23,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 14:27:23,847 INFO L158 Benchmark]: Toolchain (without parser) took 9636.62ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 135.7MB in the beginning and 101.7MB in the end (delta: 34.0MB). Peak memory consumption was 89.5MB. Max. memory is 8.0GB. [2022-04-15 14:27:23,847 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 152.0MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 14:27:23,847 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.69ms. Allocated memory is still 182.5MB. Free memory was 135.5MB in the beginning and 160.9MB in the end (delta: -25.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. [2022-04-15 14:27:23,847 INFO L158 Benchmark]: Boogie Preprocessor took 51.87ms. Allocated memory is still 182.5MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 14:27:23,847 INFO L158 Benchmark]: RCFGBuilder took 331.75ms. Allocated memory is still 182.5MB. Free memory was 159.1MB in the beginning and 147.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 14:27:23,848 INFO L158 Benchmark]: TraceAbstraction took 8961.81ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 147.3MB in the beginning and 101.7MB in the end (delta: 45.6MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. [2022-04-15 14:27:23,849 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory was 152.0MB in the beginning and 152.0MB in the end (delta: 73.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.69ms. Allocated memory is still 182.5MB. Free memory was 135.5MB in the beginning and 160.9MB in the end (delta: -25.4MB). Peak memory consumption was 11.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.87ms. Allocated memory is still 182.5MB. Free memory was 160.9MB in the beginning and 159.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 331.75ms. Allocated memory is still 182.5MB. Free memory was 159.1MB in the beginning and 147.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8961.81ms. Allocated memory was 182.5MB in the beginning and 237.0MB in the end (delta: 54.5MB). Free memory was 147.3MB in the beginning and 101.7MB in the end (delta: 45.6MB). Peak memory consumption was 100.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 47 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 27 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 27 mSolverCounterUnsat, 212 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 231 GetRequests, 209 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=6, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 137 PreInvPairs, 184 NumberOfFragments, 361 HoareAnnotationTreeSize, 137 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 33 FomulaSimplificationsInter, 332 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: ((!(\old(counter) <= 0) || (((A == r && 0 <= counter) && B == b) && q == 0)) || ((A == r && 1 <= counter) && q == 0)) || !(0 <= \old(counter)) - ProcedureContractResult [Line: 15]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 26]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 18]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: !(1 <= \old(cond)) || 1 <= cond RESULT: Ultimate proved your program to be correct! [2022-04-15 14:27:23,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...