./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:21:19,886 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:21:19,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:21:19,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:21:19,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:21:20,003 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:21:20,005 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:21:20,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:21:20,006 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:21:20,007 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:21:20,009 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:21:20,009 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:21:20,024 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:21:20,024 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:21:20,025 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:21:20,025 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:21:20,026 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:21:20,026 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:21:20,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:21:20,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:21:20,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:21:20,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:21:20,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:21:20,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:21:20,030 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:21:20,031 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:21:20,031 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:21:20,031 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:21:20,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:21:20,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:21:20,032 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:21:20,032 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:21:20,032 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:20,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:21:20,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:21:20,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:21:20,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:21:20,035 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:21:20,035 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:21:20,035 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:21:20,036 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:21:20,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:21:20,036 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 [2024-11-20 02:21:20,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:21:20,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:21:20,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:21:20,322 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:21:20,322 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:21:20,324 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:21,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:21:22,018 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:21:22,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:22,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbd77b3/621e7961ca894aceb39ae332b62c5bb3/FLAGabcee50f4 [2024-11-20 02:21:22,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dbd77b3/621e7961ca894aceb39ae332b62c5bb3 [2024-11-20 02:21:22,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:21:22,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:21:22,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:22,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:21:22,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:21:22,056 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@408468c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22, skipping insertion in model container [2024-11-20 02:21:22,057 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,088 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:21:22,250 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i[919,932] [2024-11-20 02:21:22,294 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:22,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:21:22,317 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i[919,932] [2024-11-20 02:21:22,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:22,360 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:21:22,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22 WrapperNode [2024-11-20 02:21:22,360 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:22,361 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:22,361 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:21:22,362 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:21:22,369 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,421 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2024-11-20 02:21:22,421 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:22,422 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:21:22,422 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:21:22,422 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:21:22,434 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,437 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,460 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:21:22,460 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,471 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,478 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,484 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,488 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:21:22,489 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:21:22,489 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:21:22,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:21:22,495 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (1/1) ... [2024-11-20 02:21:22,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:22,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:22,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:21:22,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:21:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:21:22,571 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:21:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:21:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:21:22,572 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:21:22,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:21:22,632 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:21:22,634 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:21:23,028 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-11-20 02:21:23,028 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:21:23,044 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:21:23,044 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:21:23,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:23 BoogieIcfgContainer [2024-11-20 02:21:23,045 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:21:23,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:21:23,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:21:23,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:21:23,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:21:22" (1/3) ... [2024-11-20 02:21:23,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:23, skipping insertion in model container [2024-11-20 02:21:23,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:22" (2/3) ... [2024-11-20 02:21:23,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbd3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:23, skipping insertion in model container [2024-11-20 02:21:23,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:23" (3/3) ... [2024-11-20 02:21:23,055 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:23,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:21:23,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:21:23,153 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:21:23,160 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@606b520c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:21:23,161 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:21:23,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 02:21:23,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-20 02:21:23,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:23,182 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:23,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:23,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:23,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1794822710, now seen corresponding path program 1 times [2024-11-20 02:21:23,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:23,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842704681] [2024-11-20 02:21:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:23,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:24,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:24,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:21:24,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:21:24,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 02:21:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:21:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 02:21:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 02:21:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:21:24,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:21:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:21:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:24,520 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 02:21:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:24,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842704681] [2024-11-20 02:21:24,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842704681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:24,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:21:24,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784247205] [2024-11-20 02:21:24,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:24,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:21:24,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:24,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:21:24,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:21:24,561 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 44 states have internal predecessors, (63), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 02:21:24,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:24,849 INFO L93 Difference]: Finished difference Result 179 states and 324 transitions. [2024-11-20 02:21:24,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:21:24,854 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 117 [2024-11-20 02:21:24,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:24,865 INFO L225 Difference]: With dead ends: 179 [2024-11-20 02:21:24,867 INFO L226 Difference]: Without dead ends: 118 [2024-11-20 02:21:24,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:24,875 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 61 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:24,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 237 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:21:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-20 02:21:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 109. [2024-11-20 02:21:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 70 states have (on average 1.4) internal successors, (98), 70 states have internal predecessors, (98), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-20 02:21:24,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 170 transitions. [2024-11-20 02:21:24,943 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 170 transitions. Word has length 117 [2024-11-20 02:21:24,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:24,946 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 170 transitions. [2024-11-20 02:21:24,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 02:21:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 170 transitions. [2024-11-20 02:21:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 02:21:24,951 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:24,951 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:24,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:21:24,952 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:24,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:24,953 INFO L85 PathProgramCache]: Analyzing trace with hash 484453592, now seen corresponding path program 1 times [2024-11-20 02:21:24,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:24,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262327441] [2024-11-20 02:21:24,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:24,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:24,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:21:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:25,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:21:25,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 02:21:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:21:25,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 02:21:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 02:21:25,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:25,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:21:25,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:21:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:21:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,286 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-20 02:21:25,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:25,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262327441] [2024-11-20 02:21:25,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262327441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:25,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:25,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 02:21:25,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608586388] [2024-11-20 02:21:25,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:25,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:21:25,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:25,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:21:25,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 02:21:25,309 INFO L87 Difference]: Start difference. First operand 109 states and 170 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 02:21:25,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:25,501 INFO L93 Difference]: Finished difference Result 249 states and 387 transitions. [2024-11-20 02:21:25,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:21:25,502 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2024-11-20 02:21:25,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:25,505 INFO L225 Difference]: With dead ends: 249 [2024-11-20 02:21:25,505 INFO L226 Difference]: Without dead ends: 179 [2024-11-20 02:21:25,506 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:25,507 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:25,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 251 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:25,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-11-20 02:21:25,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 169. [2024-11-20 02:21:25,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 111 states have internal predecessors, (153), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 02:21:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 261 transitions. [2024-11-20 02:21:25,563 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 261 transitions. Word has length 119 [2024-11-20 02:21:25,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:25,564 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 261 transitions. [2024-11-20 02:21:25,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-20 02:21:25,564 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 261 transitions. [2024-11-20 02:21:25,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 02:21:25,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:25,567 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:25,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:21:25,567 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:25,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:25,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1942967792, now seen corresponding path program 1 times [2024-11-20 02:21:25,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:25,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577191040] [2024-11-20 02:21:25,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:25,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:25,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-20 02:21:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:21:25,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-20 02:21:25,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:21:25,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:25,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-20 02:21:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-20 02:21:26,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:26,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:21:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 02:21:26,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:21:26,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2024-11-20 02:21:26,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:26,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577191040] [2024-11-20 02:21:26,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577191040] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:21:26,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115175263] [2024-11-20 02:21:26,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:26,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:21:26,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:26,093 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:21:26,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 02:21:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:26,230 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 02:21:26,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:26,627 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-20 02:21:26,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:21:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 48 proven. 51 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2024-11-20 02:21:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115175263] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:21:26,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:21:26,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2024-11-20 02:21:26,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666984017] [2024-11-20 02:21:26,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:21:26,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:21:26,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:26,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:21:26,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:21:26,971 INFO L87 Difference]: Start difference. First operand 169 states and 261 transitions. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-20 02:21:27,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:27,265 INFO L93 Difference]: Finished difference Result 336 states and 492 transitions. [2024-11-20 02:21:27,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:21:27,266 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) Word has length 121 [2024-11-20 02:21:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:27,269 INFO L225 Difference]: With dead ends: 336 [2024-11-20 02:21:27,269 INFO L226 Difference]: Without dead ends: 211 [2024-11-20 02:21:27,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=269, Unknown=0, NotChecked=0, Total=420 [2024-11-20 02:21:27,271 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 124 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:27,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 170 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:21:27,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-20 02:21:27,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 193. [2024-11-20 02:21:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.302325581395349) internal successors, (168), 129 states have internal predecessors, (168), 54 states have call successors, (54), 9 states have call predecessors, (54), 9 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-20 02:21:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 276 transitions. [2024-11-20 02:21:27,303 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 276 transitions. Word has length 121 [2024-11-20 02:21:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:27,306 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 276 transitions. [2024-11-20 02:21:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 6 states have call successors, (38), 3 states have call predecessors, (38), 7 states have return successors, (39), 6 states have call predecessors, (39), 6 states have call successors, (39) [2024-11-20 02:21:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 276 transitions. [2024-11-20 02:21:27,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-20 02:21:27,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:27,308 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:27,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:21:27,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:21:27,509 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:27,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:27,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1684802354, now seen corresponding path program 1 times [2024-11-20 02:21:27,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:27,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860538057] [2024-11-20 02:21:27,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:27,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:21:27,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517782703] [2024-11-20 02:21:27,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:27,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:21:27,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:27,599 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:21:27,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 02:21:27,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:21:27,724 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:21:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:21:27,827 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:21:27,828 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:21:27,829 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:21:27,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 02:21:28,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-20 02:21:28,035 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 02:21:28,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:21:28,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:21:28 BoogieIcfgContainer [2024-11-20 02:21:28,151 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:21:28,152 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:21:28,152 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:21:28,152 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:21:28,152 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:23" (3/4) ... [2024-11-20 02:21:28,156 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:21:28,157 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:21:28,157 INFO L158 Benchmark]: Toolchain (without parser) took 6107.69ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 129.8MB in the beginning and 167.6MB in the end (delta: -37.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-20 02:21:28,158 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:21:28,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.98ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 114.5MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:21:28,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.23ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 111.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:21:28,159 INFO L158 Benchmark]: Boogie Preprocessor took 66.55ms. Allocated memory is still 176.2MB. Free memory was 111.7MB in the beginning and 108.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 02:21:28,159 INFO L158 Benchmark]: RCFGBuilder took 555.31ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 88.6MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-20 02:21:28,159 INFO L158 Benchmark]: TraceAbstraction took 5103.13ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 87.9MB in the beginning and 167.6MB in the end (delta: -79.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:21:28,159 INFO L158 Benchmark]: Witness Printer took 5.22ms. Allocated memory is still 232.8MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:21:28,163 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 176.2MB. Free memory is still 144.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.98ms. Allocated memory is still 176.2MB. Free memory was 129.8MB in the beginning and 114.5MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.23ms. Allocated memory is still 176.2MB. Free memory was 114.5MB in the beginning and 111.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.55ms. Allocated memory is still 176.2MB. Free memory was 111.7MB in the beginning and 108.2MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 555.31ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 88.6MB in the end (delta: 19.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 5103.13ms. Allocated memory was 176.2MB in the beginning and 232.8MB in the end (delta: 56.6MB). Free memory was 87.9MB in the beginning and 167.6MB in the end (delta: -79.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.22ms. Allocated memory is still 232.8MB. Free memory is still 167.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 127, overapproximation of bitwiseOr at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -32; [L23] signed long int var_1_3 = 10; [L24] signed long int var_1_4 = 64; [L25] unsigned short int var_1_11 = 64; [L26] unsigned short int var_1_12 = 8; [L27] unsigned short int var_1_13 = 5; [L28] signed short int var_1_14 = 8; [L29] unsigned short int var_1_15 = 62763; [L30] unsigned long int var_1_16 = 25; [L31] float var_1_18 = 63.25; [L32] unsigned char var_1_20 = 0; [L33] float var_1_21 = 7.8; [L34] float var_1_22 = 32.1; [L35] unsigned char var_1_23 = 0; [L36] signed long int var_1_24 = -16; [L37] signed long int last_1_var_1_1 = -32; [L38] unsigned short int last_1_var_1_11 = 64; [L39] signed short int last_1_var_1_14 = 8; [L40] unsigned long int last_1_var_1_16 = 25; [L41] float last_1_var_1_18 = 63.25; VAL [isInitial=0, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L131] isInitial = 1 [L132] FCALL initially() [L133] COND TRUE 1 [L134] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_11 = var_1_11 [L122] last_1_var_1_14 = var_1_14 [L123] last_1_var_1_16 = var_1_16 [L124] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=10, var_1_4=64] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L91] var_1_3 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L92] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L93] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L93] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L94] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L94] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=64] [L95] var_1_4 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L96] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L97] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L97] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L98] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L98] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=8, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L99] var_1_12 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L100] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L101] CALL assume_abort_if_not(var_1_12 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L101] RET assume_abort_if_not(var_1_12 <= 16384) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=5, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L102] var_1_13 = __VERIFIER_nondet_ushort() [L103] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L103] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L104] CALL assume_abort_if_not(var_1_13 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L104] RET assume_abort_if_not(var_1_13 <= 16383) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=62763, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L105] var_1_15 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L106] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L107] CALL assume_abort_if_not(var_1_15 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L107] RET assume_abort_if_not(var_1_15 <= 65535) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=0, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L108] var_1_20 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L109] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L110] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L110] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_21=39/5, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L111] var_1_21 = __VERIFIER_nondet_float() [L112] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L112] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_22=321/10, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L113] var_1_22 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L114] RET assume_abort_if_not((var_1_22 >= -461168.6018427382800e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 4611686.018427382800e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=0, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L115] var_1_23 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L116] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L117] CALL assume_abort_if_not(var_1_23 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L117] RET assume_abort_if_not(var_1_23 <= 1) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L135] RET updateVariables() [L136] CALL step() [L45] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=-32, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L45] COND FALSE !((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) [L52] var_1_1 = last_1_var_1_11 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=-16, var_1_3=-7, var_1_4=-6] [L54] COND FALSE !((- (- last_1_var_1_18)) != last_1_var_1_18) [L61] var_1_24 = last_1_var_1_14 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L63] COND FALSE !(((var_1_15 - var_1_12) + var_1_24) < var_1_24) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=253/4, var_1_1=64, var_1_20=1, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L66] COND FALSE !(var_1_24 < var_1_13) [L77] var_1_18 = var_1_21 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=64, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L79] COND TRUE var_1_18 != (var_1_18 + var_1_18) [L80] var_1_11 = ((var_1_12 + var_1_13) + 32) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=25, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L82] COND FALSE !(((var_1_1 * var_1_4) + var_1_1) > var_1_1) [L87] var_1_16 = 0u VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR last_1_var_1_1 | last_1_var_1_16 VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L127-L128] return (((((((last_1_var_1_14 / ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) <= (last_1_var_1_1 | last_1_var_1_16)) ? (((last_1_var_1_18 * last_1_var_1_18) < last_1_var_1_18) ? (var_1_1 == ((signed long int) last_1_var_1_11)) : (var_1_1 == ((signed long int) last_1_var_1_11))) : (var_1_1 == ((signed long int) last_1_var_1_11))) && ((var_1_18 != (var_1_18 + var_1_18)) ? (var_1_11 == ((unsigned short int) ((var_1_12 + var_1_13) + 32))) : 1)) && ((((var_1_15 - var_1_12) + var_1_24) < var_1_24) ? (var_1_14 == ((signed short int) var_1_12)) : 1)) && ((((var_1_1 * var_1_4) + var_1_1) > var_1_1) ? ((var_1_14 < var_1_1) ? (var_1_16 == ((unsigned long int) var_1_12)) : 1) : (var_1_16 == ((unsigned long int) 0u)))) && ((var_1_24 < var_1_13) ? (var_1_20 ? (var_1_18 == ((float) (((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))) + var_1_22))) : (var_1_23 ? (var_1_18 == ((float) (var_1_22 + var_1_21))) : (var_1_18 == ((float) -0.75f)))) : (var_1_18 == ((float) var_1_21)))) && (((- (- last_1_var_1_18)) != last_1_var_1_18) ? ((var_1_12 <= ((((last_1_var_1_14) > ((- last_1_var_1_14))) ? (last_1_var_1_14) : ((- last_1_var_1_14))))) ? (var_1_24 == ((signed long int) -50)) : (var_1_24 == ((signed long int) last_1_var_1_14))) : (var_1_24 == ((signed long int) last_1_var_1_14))) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=64, last_1_var_1_14=8, last_1_var_1_16=25, last_1_var_1_18=253/4, last_1_var_1_1=-32, var_1_11=32, var_1_12=0, var_1_13=0, var_1_14=8, var_1_15=32767, var_1_16=0, var_1_18=2, var_1_1=64, var_1_20=1, var_1_21=2, var_1_23=1, var_1_24=8, var_1_3=-7, var_1_4=-6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 4, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 275 mSDsluCounter, 658 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 418 mSDsCounter, 156 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 233 IncrementalHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 156 mSolverCounterUnsat, 240 mSDtfsCounter, 233 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=193occurred in iteration=3, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 594 ConstructedInterpolants, 0 QuantifiedInterpolants, 2671 SizeOfPredicates, 3 NumberOfNonLiveVariables, 294 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 2913/3060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 02:21:28,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:21:30,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:21:30,463 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:21:30,469 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:21:30,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:21:30,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:21:30,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:21:30,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:21:30,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:21:30,507 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:21:30,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:21:30,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:21:30,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:21:30,509 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:21:30,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:21:30,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:21:30,512 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:21:30,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:21:30,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:21:30,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:21:30,515 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:21:30,516 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:21:30,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:21:30,517 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:21:30,518 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:21:30,518 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:21:30,518 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:21:30,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:21:30,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:21:30,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:21:30,519 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:21:30,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:21:30,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:21:30,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:21:30,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:30,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:21:30,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:21:30,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:21:30,522 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:21:30,522 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:21:30,523 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:21:30,523 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:21:30,523 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:21:30,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:21:30,523 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bdc619285dc209002e8438907f639db580a778826e48cc5794b2e711b82e87d5 [2024-11-20 02:21:30,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:21:30,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:21:30,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:21:30,919 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:21:30,920 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:21:30,921 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:32,475 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:21:32,691 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:21:32,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:32,699 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946c38400/632e23a360624c00ae07dcb12e3af6bd/FLAG2a60cc89b [2024-11-20 02:21:32,710 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/946c38400/632e23a360624c00ae07dcb12e3af6bd [2024-11-20 02:21:32,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:21:32,713 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:21:32,715 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:32,715 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:21:32,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:21:32,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:32" (1/1) ... [2024-11-20 02:21:32,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186674dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:32, skipping insertion in model container [2024-11-20 02:21:32,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:32" (1/1) ... [2024-11-20 02:21:32,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:21:32,927 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i[919,932] [2024-11-20 02:21:32,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:33,008 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:21:33,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-90.i[919,932] [2024-11-20 02:21:33,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:33,076 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:21:33,076 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33 WrapperNode [2024-11-20 02:21:33,077 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:33,078 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:33,078 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:21:33,078 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:21:33,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,099 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,136 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 129 [2024-11-20 02:21:33,137 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:33,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:21:33,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:21:33,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:21:33,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,158 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,181 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 02:21:33,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,195 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,202 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:21:33,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:21:33,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:21:33,221 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:21:33,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (1/1) ... [2024-11-20 02:21:33,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:33,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:33,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 02:21:33,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 02:21:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:21:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:21:33,302 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:21:33,303 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:21:33,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:21:33,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:21:33,388 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:21:33,391 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:21:34,107 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:21:34,107 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:21:34,125 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:21:34,126 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:21:34,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:34 BoogieIcfgContainer [2024-11-20 02:21:34,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:21:34,129 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:21:34,130 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:21:34,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:21:34,134 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:21:32" (1/3) ... [2024-11-20 02:21:34,135 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17742d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:34, skipping insertion in model container [2024-11-20 02:21:34,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:33" (2/3) ... [2024-11-20 02:21:34,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17742d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:34, skipping insertion in model container [2024-11-20 02:21:34,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:34" (3/3) ... [2024-11-20 02:21:34,138 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-90.i [2024-11-20 02:21:34,154 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:21:34,154 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:21:34,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:21:34,230 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6448f5e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:21:34,230 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:21:34,234 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 02:21:34,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 02:21:34,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:34,248 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:34,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash -934770467, now seen corresponding path program 1 times [2024-11-20 02:21:34,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:34,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100837849] [2024-11-20 02:21:34,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:34,266 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:21:34,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:34,269 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:21:34,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:21:34,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:34,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:21:34,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:34,646 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-20 02:21:34,647 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:21:34,647 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:21:34,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100837849] [2024-11-20 02:21:34,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100837849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:34,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:34,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:21:34,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804623950] [2024-11-20 02:21:34,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:34,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:21:34,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:21:34,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:21:34,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:21:34,686 INFO L87 Difference]: Start difference. First operand has 57 states, 36 states have (on average 1.4444444444444444) internal successors, (52), 37 states have internal predecessors, (52), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 02:21:34,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:34,719 INFO L93 Difference]: Finished difference Result 107 states and 188 transitions. [2024-11-20 02:21:34,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:21:34,721 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 114 [2024-11-20 02:21:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:34,730 INFO L225 Difference]: With dead ends: 107 [2024-11-20 02:21:34,730 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 02:21:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:21:34,737 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:34,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:21:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 02:21:34,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-20 02:21:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-20 02:21:34,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 81 transitions. [2024-11-20 02:21:34,790 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 81 transitions. Word has length 114 [2024-11-20 02:21:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:34,791 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 81 transitions. [2024-11-20 02:21:34,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-20 02:21:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 81 transitions. [2024-11-20 02:21:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 02:21:34,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:34,797 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:34,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 02:21:34,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:21:34,998 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:34,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:34,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1577401253, now seen corresponding path program 1 times [2024-11-20 02:21:35,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:35,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436511699] [2024-11-20 02:21:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:35,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:21:35,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:35,004 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:21:35,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 02:21:35,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:35,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 02:21:35,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:36,396 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-20 02:21:36,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:21:36,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:21:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436511699] [2024-11-20 02:21:36,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1436511699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:21:36,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [645543511] [2024-11-20 02:21:36,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:36,740 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:21:36,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:21:36,743 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 02:21:36,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-20 02:21:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:38,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 02:21:38,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:38,878 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 383 proven. 48 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2024-11-20 02:21:38,882 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:21:39,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [645543511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:21:39,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:21:39,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2024-11-20 02:21:39,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347563510] [2024-11-20 02:21:39,057 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:21:39,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:21:39,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:21:39,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:21:39,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-20 02:21:39,063 INFO L87 Difference]: Start difference. First operand 53 states and 81 transitions. Second operand has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 02:21:41,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:41,856 INFO L93 Difference]: Finished difference Result 209 states and 309 transitions. [2024-11-20 02:21:41,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 02:21:41,866 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 114 [2024-11-20 02:21:41,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:41,869 INFO L225 Difference]: With dead ends: 209 [2024-11-20 02:21:41,869 INFO L226 Difference]: Without dead ends: 159 [2024-11-20 02:21:41,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2024-11-20 02:21:41,872 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 148 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:41,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 418 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 02:21:41,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-20 02:21:41,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 133. [2024-11-20 02:21:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 86 states have internal predecessors, (116), 42 states have call successors, (42), 5 states have call predecessors, (42), 5 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-20 02:21:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 200 transitions. [2024-11-20 02:21:41,914 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 200 transitions. Word has length 114 [2024-11-20 02:21:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:41,918 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 200 transitions. [2024-11-20 02:21:41,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 10 states have internal predecessors, (39), 3 states have call successors, (18), 3 states have call predecessors, (18), 5 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-20 02:21:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 200 transitions. [2024-11-20 02:21:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-20 02:21:41,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:41,921 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:41,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-20 02:21:42,131 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 02:21:42,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:21:42,323 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:42,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:42,324 INFO L85 PathProgramCache]: Analyzing trace with hash 768054627, now seen corresponding path program 1 times [2024-11-20 02:21:42,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:42,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1528498722] [2024-11-20 02:21:42,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:42,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 02:21:42,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:42,328 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:21:42,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 02:21:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:42,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 02:21:42,641 INFO L278 TraceCheckSpWp]: Computing forward predicates...