/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:47:38,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:47:38,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:47:38,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:47:38,718 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:47:38,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:47:38,722 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:47:38,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:47:38,726 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:47:38,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:47:38,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:47:38,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:47:38,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:47:38,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:47:38,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:47:38,738 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:47:38,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:47:38,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:47:38,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:47:38,742 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:47:38,744 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:47:38,745 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:47:38,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:47:38,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:47:38,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:47:38,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:47:38,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:47:38,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:47:38,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:47:38,754 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:47:38,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:47:38,755 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:47:38,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:47:38,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:47:38,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:47:38,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:47:38,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:47:38,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:47:38,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:47:38,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:47:38,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:47:38,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:47:38,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:47:38,771 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:47:38,771 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:47:38,772 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:47:38,773 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:47:38,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:47:38,774 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:47:38,774 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:47:38,774 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:47:38,774 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:47:38,774 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:38,775 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:47:38,775 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:47:38,776 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:47:38,776 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:47:38,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:47:39,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:47:39,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:47:39,025 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:47:39,027 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:47:39,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-08 03:47:39,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379243ec4/494abb02d9aa4a4bb3a84fe1298504eb/FLAGbd79e414e [2022-04-08 03:47:39,435 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:47:39,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c [2022-04-08 03:47:39,440 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379243ec4/494abb02d9aa4a4bb3a84fe1298504eb/FLAGbd79e414e [2022-04-08 03:47:39,448 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379243ec4/494abb02d9aa4a4bb3a84fe1298504eb [2022-04-08 03:47:39,450 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:47:39,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:47:39,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:39,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:47:39,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:47:39,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@798014ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39, skipping insertion in model container [2022-04-08 03:47:39,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:47:39,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:47:39,577 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-08 03:47:39,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:39,600 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:47:39,608 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_2-2.c[373,386] [2022-04-08 03:47:39,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:39,625 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:47:39,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39 WrapperNode [2022-04-08 03:47:39,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:39,626 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:47:39,626 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:47:39,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:47:39,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,649 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,654 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:47:39,656 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:47:39,656 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:47:39,656 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:47:39,656 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (1/1) ... [2022-04-08 03:47:39,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:39,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:39,686 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:47:39,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:47:39,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:47:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:47:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:47:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:47:39,720 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:47:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:47:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:47:39,720 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:47:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:47:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 03:47:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:47:39,721 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:47:39,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:47:39,773 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:47:39,775 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:47:39,915 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:47:39,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:47:39,921 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:47:39,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:39 BoogieIcfgContainer [2022-04-08 03:47:39,930 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:47:39,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:47:39,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:47:39,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:47:39,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:47:39" (1/3) ... [2022-04-08 03:47:39,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438202cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:39, skipping insertion in model container [2022-04-08 03:47:39,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:39" (2/3) ... [2022-04-08 03:47:39,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@438202cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:39, skipping insertion in model container [2022-04-08 03:47:39,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:39" (3/3) ... [2022-04-08 03:47:39,937 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_2-2.c [2022-04-08 03:47:39,941 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:47:39,942 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:47:39,979 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:47:39,999 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:47:40,000 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:47:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 03:47:40,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:40,019 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:40,019 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:40,019 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:40,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:40,023 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 1 times [2022-04-08 03:47:40,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:40,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [481646555] [2022-04-08 03:47:40,042 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:40,042 INFO L85 PathProgramCache]: Analyzing trace with hash -154663714, now seen corresponding path program 2 times [2022-04-08 03:47:40,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:40,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851990930] [2022-04-08 03:47:40,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:40,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:40,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:40,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 03:47:40,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 03:47:40,177 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-08 03:47:40,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:40,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 03:47:40,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 03:47:40,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #96#return; {31#true} is VALID [2022-04-08 03:47:40,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret6 := main(); {31#true} is VALID [2022-04-08 03:47:40,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {31#true} is VALID [2022-04-08 03:47:40,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-08 03:47:40,180 INFO L272 TraceCheckUtils]: 7: Hoare triple {32#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {32#false} is VALID [2022-04-08 03:47:40,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 03:47:40,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 03:47:40,180 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 03:47:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:40,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:40,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851990930] [2022-04-08 03:47:40,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851990930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:40,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:40,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:40,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:40,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [481646555] [2022-04-08 03:47:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [481646555] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:40,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476600141] [2022-04-08 03:47:40,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:47:40,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:40,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:40,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:47:40,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:40,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:47:40,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:40,244 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,328 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-08 03:47:40,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:47:40,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:47:40,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:40,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 03:47:40,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-08 03:47:40,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-08 03:47:40,417 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-08 03:47:40,422 INFO L225 Difference]: With dead ends: 39 [2022-04-08 03:47:40,423 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 03:47:40,424 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:40,427 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 29 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:40,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:40,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 03:47:40,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 03:47:40,447 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:40,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,448 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,448 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,451 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-08 03:47:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 03:47:40,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:40,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:40,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 03:47:40,452 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 03:47:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,454 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2022-04-08 03:47:40,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 03:47:40,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:40,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:40,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:40,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 32 transitions. [2022-04-08 03:47:40,461 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 32 transitions. Word has length 11 [2022-04-08 03:47:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:40,461 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 32 transitions. [2022-04-08 03:47:40,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,462 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 32 transitions. [2022-04-08 03:47:40,495 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-08 03:47:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 32 transitions. [2022-04-08 03:47:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:40,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:40,496 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:40,497 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:47:40,497 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 1 times [2022-04-08 03:47:40,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:40,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1443990915] [2022-04-08 03:47:40,498 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:40,499 INFO L85 PathProgramCache]: Analyzing trace with hash -213769058, now seen corresponding path program 2 times [2022-04-08 03:47:40,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:40,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196236040] [2022-04-08 03:47:40,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:40,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:40,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:40,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-08 03:47:40,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-08 03:47:40,596 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-08 03:47:40,596 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} call ULTIMATE.init(); {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:40,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {211#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {205#true} is VALID [2022-04-08 03:47:40,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} assume true; {205#true} is VALID [2022-04-08 03:47:40,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} #96#return; {205#true} is VALID [2022-04-08 03:47:40,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} call #t~ret6 := main(); {205#true} is VALID [2022-04-08 03:47:40,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {210#(= main_~x~0 0)} is VALID [2022-04-08 03:47:40,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {210#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {206#false} is VALID [2022-04-08 03:47:40,598 INFO L272 TraceCheckUtils]: 7: Hoare triple {206#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {206#false} is VALID [2022-04-08 03:47:40,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {206#false} ~cond := #in~cond; {206#false} is VALID [2022-04-08 03:47:40,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {206#false} assume 0 == ~cond; {206#false} is VALID [2022-04-08 03:47:40,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#false} assume !false; {206#false} is VALID [2022-04-08 03:47:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:40,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:40,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196236040] [2022-04-08 03:47:40,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196236040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:40,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:40,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1443990915] [2022-04-08 03:47:40,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1443990915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:40,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:40,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104392141] [2022-04-08 03:47:40,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:40,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:47:40,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:40,604 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:40,611 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:47:40,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:40,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:47:40,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:47:40,614 INFO L87 Difference]: Start difference. First operand 22 states and 32 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,737 INFO L93 Difference]: Finished difference Result 29 states and 40 transitions. [2022-04-08 03:47:40,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:47:40,737 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-08 03:47:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-08 03:47:40,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-08 03:47:40,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-08 03:47:40,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:40,792 INFO L225 Difference]: With dead ends: 29 [2022-04-08 03:47:40,792 INFO L226 Difference]: Without dead ends: 24 [2022-04-08 03:47:40,793 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:47:40,796 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 28 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:40,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 36 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:40,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-08 03:47:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-04-08 03:47:40,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:40,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,808 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,809 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,810 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-08 03:47:40,810 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-08 03:47:40,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:40,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:40,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 03:47:40,811 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 24 states. [2022-04-08 03:47:40,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:40,813 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2022-04-08 03:47:40,813 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 35 transitions. [2022-04-08 03:47:40,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:40,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:40,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:40,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 18 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 33 transitions. [2022-04-08 03:47:40,816 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 33 transitions. Word has length 11 [2022-04-08 03:47:40,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:40,817 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 33 transitions. [2022-04-08 03:47:40,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:40,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 33 transitions. [2022-04-08 03:47:40,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:40,842 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 33 transitions. [2022-04-08 03:47:40,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:47:40,843 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:40,843 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:40,843 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:47:40,843 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:40,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:40,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 1 times [2022-04-08 03:47:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:40,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2138704460] [2022-04-08 03:47:40,919 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:47:40,919 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 03:47:40,921 INFO L85 PathProgramCache]: Analyzing trace with hash 279245208, now seen corresponding path program 1 times [2022-04-08 03:47:40,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:40,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845566442] [2022-04-08 03:47:40,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:40,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:40,950 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 03:47:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:40,982 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 03:47:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1726513949, now seen corresponding path program 2 times [2022-04-08 03:47:40,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:40,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020803412] [2022-04-08 03:47:40,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:40,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:41,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:41,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 03:47:41,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 03:47:41,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-08 03:47:41,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {368#true} call ULTIMATE.init(); {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:41,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {374#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {368#true} is VALID [2022-04-08 03:47:41,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {368#true} assume true; {368#true} is VALID [2022-04-08 03:47:41,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {368#true} {368#true} #96#return; {368#true} is VALID [2022-04-08 03:47:41,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {368#true} call #t~ret6 := main(); {368#true} is VALID [2022-04-08 03:47:41,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {368#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {368#true} is VALID [2022-04-08 03:47:41,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#true} assume !!(~x~0 % 4294967296 < 99); {368#true} is VALID [2022-04-08 03:47:41,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#true} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {373#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} is VALID [2022-04-08 03:47:41,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {373#(not (= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {369#false} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := ~x~0 - 4; {369#false} is VALID [2022-04-08 03:47:41,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {369#false} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;~x~0 := 2 + ~x~0; {369#false} is VALID [2022-04-08 03:47:41,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {369#false} assume !(~x~0 % 4294967296 < 99); {369#false} is VALID [2022-04-08 03:47:41,039 INFO L272 TraceCheckUtils]: 18: Hoare triple {369#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {369#false} is VALID [2022-04-08 03:47:41,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {369#false} ~cond := #in~cond; {369#false} is VALID [2022-04-08 03:47:41,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {369#false} assume 0 == ~cond; {369#false} is VALID [2022-04-08 03:47:41,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {369#false} assume !false; {369#false} is VALID [2022-04-08 03:47:41,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:41,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:41,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020803412] [2022-04-08 03:47:41,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020803412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:41,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:41,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:41,041 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:41,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2138704460] [2022-04-08 03:47:41,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2138704460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:41,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:41,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:41,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825606845] [2022-04-08 03:47:41,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 03:47:41,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:41,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:41,065 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:47:41,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:41,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:47:41,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:47:41,066 INFO L87 Difference]: Start difference. First operand 23 states and 33 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:41,215 INFO L93 Difference]: Finished difference Result 51 states and 82 transitions. [2022-04-08 03:47:41,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:47:41,215 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 03:47:41,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-08 03:47:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2022-04-08 03:47:41,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2022-04-08 03:47:41,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:41,282 INFO L225 Difference]: With dead ends: 51 [2022-04-08 03:47:41,282 INFO L226 Difference]: Without dead ends: 35 [2022-04-08 03:47:41,282 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:47:41,283 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:41,283 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:41,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-08 03:47:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-08 03:47:41,298 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:41,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,299 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,300 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:41,305 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 03:47:41,305 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 03:47:41,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:41,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:41,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 03:47:41,306 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-08 03:47:41,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:41,307 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-08 03:47:41,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-08 03:47:41,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:41,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:41,308 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:41,308 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:41,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-08 03:47:41,311 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 22 [2022-04-08 03:47:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:41,312 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-08 03:47:41,312 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:41,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-08 03:47:41,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-08 03:47:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 03:47:41,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:41,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:41,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,SelfDestructingSolverStorable2 [2022-04-08 03:47:41,354 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:41,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:41,355 INFO L85 PathProgramCache]: Analyzing trace with hash 622763737, now seen corresponding path program 1 times [2022-04-08 03:47:41,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:41,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1665833542] [2022-04-08 03:47:41,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:47:41,670 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post5_8|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:47:41,674 INFO L158 Benchmark]: Toolchain (without parser) took 2223.06ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 150.6MB in the beginning and 167.0MB in the end (delta: -16.4MB). Peak memory consumption was 59.0MB. Max. memory is 8.0GB. [2022-04-08 03:47:41,674 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 199.2MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:47:41,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.52ms. Allocated memory is still 199.2MB. Free memory was 150.3MB in the beginning and 175.2MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:47:41,674 INFO L158 Benchmark]: Boogie Preprocessor took 28.68ms. Allocated memory is still 199.2MB. Free memory was 175.2MB in the beginning and 173.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:47:41,675 INFO L158 Benchmark]: RCFGBuilder took 274.50ms. Allocated memory is still 199.2MB. Free memory was 173.7MB in the beginning and 161.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 03:47:41,675 INFO L158 Benchmark]: TraceAbstraction took 1740.36ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 161.1MB in the beginning and 167.0MB in the end (delta: -5.9MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. [2022-04-08 03:47:41,676 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.09ms. Allocated memory is still 199.2MB. Free memory is still 166.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.52ms. Allocated memory is still 199.2MB. Free memory was 150.3MB in the beginning and 175.2MB in the end (delta: -24.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.68ms. Allocated memory is still 199.2MB. Free memory was 175.2MB in the beginning and 173.7MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.50ms. Allocated memory is still 199.2MB. Free memory was 173.7MB in the beginning and 161.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1740.36ms. Allocated memory was 199.2MB in the beginning and 274.7MB in the end (delta: 75.5MB). Free memory was 161.1MB in the beginning and 167.0MB in the end (delta: -5.9MB). Peak memory consumption was 70.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post5_8|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post5_8|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:47:41,700 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...