/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/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:09:53,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:09:53,742 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:09:53,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:09:53,770 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:09:53,770 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:09:53,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:09:53,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:09:53,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:09:53,785 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:09:53,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:09:53,787 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:09:53,787 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:09:53,789 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:09:53,790 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:09:53,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:09:53,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:09:53,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:09:53,798 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:09:53,800 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:09:53,801 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:09:53,803 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:09:53,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:09:53,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:09:53,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:09:53,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:09:53,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:09:53,809 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:09:53,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:09:53,810 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:09:53,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:09:53,811 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:09:53,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:09:53,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:09:53,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:09:53,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:09:53,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:09:53,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:09:53,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:09:53,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:09:53,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:09:53,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:09:53,817 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 04:09:53,828 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:09:53,829 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:09:53,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:09:53,829 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:09:53,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:09:53,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:09:53,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:09:53,830 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:09:53,830 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:09:53,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:09:53,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:09:53,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:09:53,832 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:09:53,832 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 04:09:54,033 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:09:54,053 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:09:54,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:09:54,056 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:09:54,057 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:09:54,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-08 04:09:54,106 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd0377fa/6e8025bd82864adcae3320cfd2d9b563/FLAG43fcabda2 [2022-04-08 04:09:54,463 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:09:54,463 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-08 04:09:54,468 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd0377fa/6e8025bd82864adcae3320cfd2d9b563/FLAG43fcabda2 [2022-04-08 04:09:54,906 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abd0377fa/6e8025bd82864adcae3320cfd2d9b563 [2022-04-08 04:09:54,908 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:09:54,909 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:09:54,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:09:54,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:09:54,914 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:09:54,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:09:54" (1/1) ... [2022-04-08 04:09:54,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b5bd6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:54, skipping insertion in model container [2022-04-08 04:09:54,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:09:54" (1/1) ... [2022-04-08 04:09:54,920 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:09:54,929 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:09:55,078 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-08 04:09:55,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:09:55,111 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:09:55,131 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-08 04:09:55,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:09:55,144 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:09:55,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55 WrapperNode [2022-04-08 04:09:55,144 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:09:55,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:09:55,145 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:09:55,145 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:09:55,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,162 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,165 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,176 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:09:55,177 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:09:55,177 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:09:55,177 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:09:55,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (1/1) ... [2022-04-08 04:09:55,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:09:55,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:09:55,198 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 04:09:55,203 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 04:09:55,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:09:55,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:09:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:09:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:09:55,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:09:55,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:09:55,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:09:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:09:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:09:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:09:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:09:55,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:09:55,307 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:09:55,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:09:55,484 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:09:55,501 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:09:55,501 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 04:09:55,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:09:55 BoogieIcfgContainer [2022-04-08 04:09:55,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:09:55,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:09:55,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:09:55,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:09:55,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:09:54" (1/3) ... [2022-04-08 04:09:55,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c248635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:09:55, skipping insertion in model container [2022-04-08 04:09:55,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:09:55" (2/3) ... [2022-04-08 04:09:55,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c248635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:09:55, skipping insertion in model container [2022-04-08 04:09:55,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:09:55" (3/3) ... [2022-04-08 04:09:55,508 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.c [2022-04-08 04:09:55,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:09:55,513 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:09:55,567 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:09:55,579 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 04:09:55,579 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:09:55,598 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 04:09:55,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:09:55,603 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:55,603 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:55,604 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 1 times [2022-04-08 04:09:55,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:55,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427071264] [2022-04-08 04:09:55,630 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash -531959740, now seen corresponding path program 2 times [2022-04-08 04:09:55,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:55,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527969315] [2022-04-08 04:09:55,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:55,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:55,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:55,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:55,818 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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 04:09:55,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:09:55,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-08 04:09:55,821 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 04:09:55,821 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(12, 2);call #Ultimate.allocInit(12, 3); {31#true} is VALID [2022-04-08 04:09:55,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-08 04:09:55,821 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #85#return; {31#true} is VALID [2022-04-08 04:09:55,821 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-08 04:09:55,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {31#true} is VALID [2022-04-08 04:09:55,822 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {31#true} is VALID [2022-04-08 04:09:55,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {31#true} is VALID [2022-04-08 04:09:55,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {31#true} is VALID [2022-04-08 04:09:55,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {31#true} is VALID [2022-04-08 04:09:55,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} assume !true; {32#false} is VALID [2022-04-08 04:09:55,824 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {32#false} is VALID [2022-04-08 04:09:55,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2022-04-08 04:09:55,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2022-04-08 04:09:55,824 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-08 04:09:55,825 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 04:09:55,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:55,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527969315] [2022-04-08 04:09:55,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527969315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:55,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:55,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:09:55,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:55,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427071264] [2022-04-08 04:09:55,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427071264] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:55,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:55,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:09:55,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452511499] [2022-04-08 04:09:55,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:55,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 15 [2022-04-08 04:09:55,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:55,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 04:09:55,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:55,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:09:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:55,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:09:55,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:09:55,880 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 04:09:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:55,978 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-08 04:09:55,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:09:55,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 15 [2022-04-08 04:09:55,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:55,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 04:09:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 04:09:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 04:09:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 04:09:55,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-08 04:09:56,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:56,069 INFO L225 Difference]: With dead ends: 50 [2022-04-08 04:09:56,069 INFO L226 Difference]: Without dead ends: 23 [2022-04-08 04:09:56,071 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 04:09:56,074 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 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 04:09:56,074 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:56,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-08 04:09:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-08 04:09:56,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:56,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,116 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,116 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:56,118 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 04:09:56,118 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:09:56,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:56,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:56,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 04:09:56,119 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-08 04:09:56,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:56,121 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-08 04:09:56,121 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:09:56,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:56,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:56,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:56,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-08 04:09:56,124 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-08 04:09:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:56,125 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-08 04:09:56,125 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (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 04:09:56,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-08 04:09:56,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:56,149 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-08 04:09:56,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:09:56,149 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:56,149 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:56,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:09:56,150 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:56,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:56,151 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 1 times [2022-04-08 04:09:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:56,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [922954190] [2022-04-08 04:09:56,154 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:09:56,154 INFO L85 PathProgramCache]: Analyzing trace with hash -537500866, now seen corresponding path program 2 times [2022-04-08 04:09:56,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:09:56,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661005331] [2022-04-08 04:09:56,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:09:56,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:09:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:56,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:09:56,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:09:56,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {237#(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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-08 04:09:56,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-08 04:09:56,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-08 04:09:56,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {237#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:09:56,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {237#(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(12, 2);call #Ultimate.allocInit(12, 3); {231#true} is VALID [2022-04-08 04:09:56,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID [2022-04-08 04:09:56,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #85#return; {231#true} is VALID [2022-04-08 04:09:56,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret9 := main(); {231#true} is VALID [2022-04-08 04:09:56,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} ~x~0 := 0;~y~0 := 0;~z~0 := 0;~w~0 := 0;~v~0 := 0;~w~0 := 0; {231#true} is VALID [2022-04-08 04:09:56,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#true} assume !!(~w~0 % 4294967296 < 268435455);~x~0 := 0; {231#true} is VALID [2022-04-08 04:09:56,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} assume !!(~x~0 % 4294967296 < 10);~y~0 := 0; {231#true} is VALID [2022-04-08 04:09:56,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#true} assume !!(~y~0 % 4294967296 < 10);~z~0 := 0; {231#true} is VALID [2022-04-08 04:09:56,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#true} assume !!(~z~0 % 4294967296 < 10);~v~0 := 0; {236#(= main_~v~0 0)} is VALID [2022-04-08 04:09:56,268 INFO L290 TraceCheckUtils]: 10: Hoare triple {236#(= main_~v~0 0)} assume !(~v~0 % 4294967296 < 10); {232#false} is VALID [2022-04-08 04:09:56,268 INFO L272 TraceCheckUtils]: 11: Hoare triple {232#false} call __VERIFIER_assert((if (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 <= 2147483647 then (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 else (if ~v~0 % 4294967296 < 0 && 0 != ~v~0 % 4294967296 % 4 then ~v~0 % 4294967296 % 4 - 4 else ~v~0 % 4294967296 % 4) % 4294967296 % 4294967296 - 4294967296)); {232#false} is VALID [2022-04-08 04:09:56,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {232#false} ~cond := #in~cond; {232#false} is VALID [2022-04-08 04:09:56,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {232#false} assume 0 == ~cond; {232#false} is VALID [2022-04-08 04:09:56,268 INFO L290 TraceCheckUtils]: 14: Hoare triple {232#false} assume !false; {232#false} is VALID [2022-04-08 04:09:56,268 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 04:09:56,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:09:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661005331] [2022-04-08 04:09:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661005331] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:56,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:56,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:56,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:09:56,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [922954190] [2022-04-08 04:09:56,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [922954190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:09:56,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:09:56,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 04:09:56,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114025128] [2022-04-08 04:09:56,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:09:56,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-08 04:09:56,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:09:56,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:09:56,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:56,285 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 04:09:56,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:56,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 04:09:56,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 04:09:56,287 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:09:56,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:56,363 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2022-04-08 04:09:56,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 04:09:56,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-08 04:09:56,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:09:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:09:56,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-08 04:09:56,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:09:56,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-04-08 04:09:56,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 61 transitions. [2022-04-08 04:09:56,417 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:56,419 INFO L225 Difference]: With dead ends: 49 [2022-04-08 04:09:56,419 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 04:09:56,419 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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 04:09:56,420 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:09:56,421 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:09:56,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 04:09:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-08 04:09:56,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:09:56,426 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,426 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,426 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:56,428 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-08 04:09:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 04:09:56,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:56,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:56,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-08 04:09:56,429 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-08 04:09:56,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:09:56,430 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-08 04:09:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-08 04:09:56,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:09:56,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:09:56,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:09:56,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:09:56,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:09:56,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-08 04:09:56,432 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-08 04:09:56,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:09:56,432 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-08 04:09:56,432 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 04:09:56,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 28 transitions. [2022-04-08 04:09:56,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:09:56,456 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-08 04:09:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 04:09:56,456 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:09:56,457 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:09:56,457 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:09:56,457 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:09:56,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:09:56,457 INFO L85 PathProgramCache]: Analyzing trace with hash -509289700, now seen corresponding path program 1 times [2022-04-08 04:09:56,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:09:56,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1360421849] [2022-04-08 04:09:57,606 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:09:57,819 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:09:57,821 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post8_4|] 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 04:09:57,824 INFO L158 Benchmark]: Toolchain (without parser) took 2914.79ms. Allocated memory is still 185.6MB. Free memory was 133.8MB in the beginning and 105.8MB in the end (delta: 28.1MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-08 04:09:57,825 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 185.6MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:09:57,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.79ms. Allocated memory is still 185.6MB. Free memory was 133.6MB in the beginning and 162.4MB in the end (delta: -28.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:09:57,825 INFO L158 Benchmark]: Boogie Preprocessor took 31.10ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 160.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:09:57,825 INFO L158 Benchmark]: RCFGBuilder took 325.88ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 148.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:09:57,826 INFO L158 Benchmark]: TraceAbstraction took 2319.49ms. Allocated memory is still 185.6MB. Free memory was 148.1MB in the beginning and 105.8MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2022-04-08 04:09:57,830 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.13ms. Allocated memory is still 185.6MB. Free memory is still 151.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.79ms. Allocated memory is still 185.6MB. Free memory was 133.6MB in the beginning and 162.4MB in the end (delta: -28.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.10ms. Allocated memory is still 185.6MB. Free memory was 162.4MB in the beginning and 160.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 325.88ms. Allocated memory is still 185.6MB. Free memory was 160.7MB in the beginning and 148.7MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2319.49ms. Allocated memory is still 185.6MB. Free memory was 148.1MB in the beginning and 105.8MB in the end (delta: 42.4MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post8_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post8_4|]: 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 04:09:57,849 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...