./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_steplocals_file-58.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_steplocals_file-58.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 cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:41:11,266 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:41:11,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:41:11,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:41:11,349 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:41:11,376 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:41:11,377 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:41:11,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:41:11,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:41:11,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:41:11,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:41:11,380 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:41:11,380 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:41:11,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:41:11,381 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:41:11,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:41:11,382 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:41:11,382 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:41:11,383 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:41:11,383 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:41:11,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:41:11,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:41:11,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:41:11,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:41:11,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:41:11,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:41:11,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:41:11,388 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:41:11,388 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:41:11,388 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:41:11,389 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:41:11,389 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:41:11,389 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:41:11,390 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:41:11,390 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:41:11,390 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:41:11,390 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:41:11,390 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:41:11,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:41:11,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:41:11,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:41:11,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:41:11,393 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 -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2024-11-20 02:41:11,660 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:41:11,681 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:41:11,684 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:41:11,685 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:41:11,686 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:41:11,687 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-20 02:41:13,190 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:41:13,399 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:41:13,400 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-20 02:41:13,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2761bfa/37b371762fd143c0b16a1405f947fa8e/FLAG98e9e8e3c [2024-11-20 02:41:13,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e2761bfa/37b371762fd143c0b16a1405f947fa8e [2024-11-20 02:41:13,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:41:13,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:41:13,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:41:13,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:41:13,771 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:41:13,772 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:13" (1/1) ... [2024-11-20 02:41:13,773 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70c824a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:13, skipping insertion in model container [2024-11-20 02:41:13,773 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:41:13" (1/1) ... [2024-11-20 02:41:13,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:41:14,005 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_steplocals_file-58.i[917,930] [2024-11-20 02:41:14,090 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:41:14,101 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:41:14,113 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_steplocals_file-58.i[917,930] [2024-11-20 02:41:14,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:41:14,169 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:41:14,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14 WrapperNode [2024-11-20 02:41:14,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:41:14,171 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:41:14,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:41:14,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:41:14,178 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:41:14" (1/1) ... [2024-11-20 02:41:14,187 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:41:14" (1/1) ... [2024-11-20 02:41:14,264 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 157 [2024-11-20 02:41:14,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:41:14,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:41:14,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:41:14,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:41:14,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,304 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,336 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:41:14,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,347 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:41:14,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:41:14,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:41:14,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:41:14,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (1/1) ... [2024-11-20 02:41:14,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:41:14,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:41:14,414 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:41:14,417 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:41:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:41:14,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:41:14,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:41:14,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:41:14,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:41:14,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:41:14,548 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:41:14,959 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 02:41:14,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:41:14,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:41:14,974 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:41:14,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:14 BoogieIcfgContainer [2024-11-20 02:41:14,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:41:14,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:41:14,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:41:14,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:41:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:41:13" (1/3) ... [2024-11-20 02:41:14,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bc899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:14, skipping insertion in model container [2024-11-20 02:41:14,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:41:14" (2/3) ... [2024-11-20 02:41:14,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@613bc899 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:41:14, skipping insertion in model container [2024-11-20 02:41:14,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:14" (3/3) ... [2024-11-20 02:41:14,984 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2024-11-20 02:41:15,000 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:41:15,000 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:41:15,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:41:15,073 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;@1f39d17e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:41:15,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:41:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:41:15,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:41:15,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:41:15,098 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,098 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:41:15,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:41:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1900470490, now seen corresponding path program 1 times [2024-11-20 02:41:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:41:15,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193190032] [2024-11-20 02:41:15,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:41:15,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:41:15,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:41:15,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:41:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:41:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:41:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:41:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:41:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:41:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:41:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:41:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:41:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:41:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:41:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:41:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:41:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:41:15,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:41:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:41:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:41:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:41:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:41:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:41:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:41:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:41:15,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:41:15,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:41:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:41:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:41:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:41:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:15,687 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:41:15,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:41:15,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193190032] [2024-11-20 02:41:15,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193190032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:41:15,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:41:15,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:41:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954750020] [2024-11-20 02:41:15,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:41:15,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:41:15,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:41:15,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:41:15,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:41:15,735 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:41:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:41:15,763 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2024-11-20 02:41:15,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:41:15,766 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-20 02:41:15,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:41:15,774 INFO L225 Difference]: With dead ends: 145 [2024-11-20 02:41:15,774 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 02:41:15,779 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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:41:15,783 INFO L432 NwaCegarLoop]: 109 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, 109 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:41:15,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:41:15,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 02:41:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 02:41:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:41:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-20 02:41:15,846 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2024-11-20 02:41:15,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:41:15,847 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-20 02:41:15,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:41:15,847 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-20 02:41:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:41:15,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:41:15,852 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:15,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:41:15,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:41:15,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:41:15,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1011697190, now seen corresponding path program 1 times [2024-11-20 02:41:15,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:41:15,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095270054] [2024-11-20 02:41:15,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:41:15,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:41:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:41:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:41:30,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:41:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:41:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:41:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:41:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:41:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:41:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:41:30,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:41:30,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:41:30,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:41:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:41:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:41:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:41:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:41:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:41:30,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:41:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:41:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:41:30,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:41:30,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:41:30,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:41:30,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:41:30,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:41:30,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:41:30,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:41:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:41:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:41:30,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:41:30,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095270054] [2024-11-20 02:41:30,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095270054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:41:30,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:41:30,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:41:30,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978825396] [2024-11-20 02:41:30,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:41:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:41:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:41:30,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:41:30,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:41:30,246 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:41:33,875 INFO L93 Difference]: Finished difference Result 182 states and 265 transitions. [2024-11-20 02:41:33,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 02:41:33,876 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-20 02:41:33,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:41:33,883 INFO L225 Difference]: With dead ends: 182 [2024-11-20 02:41:33,883 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 02:41:33,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=188, Invalid=568, Unknown=0, NotChecked=0, Total=756 [2024-11-20 02:41:33,885 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 248 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:41:33,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 662 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-20 02:41:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 02:41:33,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 162. [2024-11-20 02:41:33,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 100 states have (on average 1.29) internal successors, (129), 101 states have internal predecessors, (129), 58 states have call successors, (58), 3 states have call predecessors, (58), 3 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 02:41:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 245 transitions. [2024-11-20 02:41:33,944 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 245 transitions. Word has length 173 [2024-11-20 02:41:33,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:41:33,945 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 245 transitions. [2024-11-20 02:41:33,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 245 transitions. [2024-11-20 02:41:33,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:41:33,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:41:33,950 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:41:33,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:41:33,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:41:33,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1068955492, now seen corresponding path program 1 times [2024-11-20 02:41:33,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:41:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639714169] [2024-11-20 02:41:33,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:41:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:41:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:41:42,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:41:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:41:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:41:42,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:41:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:41:42,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:41:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:41:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:41:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:41:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:41:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:41:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:41:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:41:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:41:42,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:41:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:41:42,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:41:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:41:42,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:41:42,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:41:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:41:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:41:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:41:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:41:42,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:41:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:41:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:41:42,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:41:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:41:42,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639714169] [2024-11-20 02:41:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639714169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:41:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:41:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 02:41:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886331072] [2024-11-20 02:41:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:41:42,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 02:41:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:41:42,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 02:41:42,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:41:42,835 INFO L87 Difference]: Start difference. First operand 162 states and 245 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:41:45,472 INFO L93 Difference]: Finished difference Result 188 states and 270 transitions. [2024-11-20 02:41:45,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 02:41:45,473 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-20 02:41:45,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:41:45,477 INFO L225 Difference]: With dead ends: 188 [2024-11-20 02:41:45,477 INFO L226 Difference]: Without dead ends: 186 [2024-11-20 02:41:45,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2024-11-20 02:41:45,480 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 190 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:41:45,483 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 633 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 02:41:45,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-20 02:41:45,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2024-11-20 02:41:45,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 102 states have (on average 1.2745098039215685) internal successors, (130), 103 states have internal predecessors, (130), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 02:41:45,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 246 transitions. [2024-11-20 02:41:45,520 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 246 transitions. Word has length 173 [2024-11-20 02:41:45,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:41:45,524 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 246 transitions. [2024-11-20 02:41:45,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:45,524 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 246 transitions. [2024-11-20 02:41:45,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:41:45,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:41:45,530 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:41:45,531 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:41:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:41:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 753531752, now seen corresponding path program 1 times [2024-11-20 02:41:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:41:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856438238] [2024-11-20 02:41:45,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:41:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:41:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:41:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:41:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:41:53,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:41:53,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:41:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:41:53,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:41:53,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:41:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:41:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:41:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:41:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:41:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:41:53,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:41:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:41:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:41:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:41:53,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:41:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:41:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:41:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:41:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:41:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:41:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:41:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:41:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:41:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:41:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:41:53,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:41:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:41:53,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856438238] [2024-11-20 02:41:53,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856438238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:41:53,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:41:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 02:41:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954754996] [2024-11-20 02:41:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:41:53,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 02:41:53,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:41:53,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 02:41:53,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:41:53,234 INFO L87 Difference]: Start difference. First operand 165 states and 246 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:41:54,067 INFO L93 Difference]: Finished difference Result 237 states and 338 transitions. [2024-11-20 02:41:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:41:54,068 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-20 02:41:54,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:41:54,072 INFO L225 Difference]: With dead ends: 237 [2024-11-20 02:41:54,072 INFO L226 Difference]: Without dead ends: 235 [2024-11-20 02:41:54,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:41:54,074 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 135 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:41:54,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 643 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:41:54,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-20 02:41:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 179. [2024-11-20 02:41:54,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 115 states have (on average 1.2782608695652173) internal successors, (147), 116 states have internal predecessors, (147), 58 states have call successors, (58), 5 states have call predecessors, (58), 5 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-20 02:41:54,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 263 transitions. [2024-11-20 02:41:54,120 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 263 transitions. Word has length 173 [2024-11-20 02:41:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:41:54,121 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 263 transitions. [2024-11-20 02:41:54,121 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:41:54,122 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 263 transitions. [2024-11-20 02:41:54,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:41:54,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:41:54,125 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:54,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:41:54,126 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:41:54,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:41:54,126 INFO L85 PathProgramCache]: Analyzing trace with hash 810790054, now seen corresponding path program 1 times [2024-11-20 02:41:54,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:41:54,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378586259] [2024-11-20 02:41:54,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:41:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:41:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:41:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:41:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:41:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:41:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:41:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:41:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:41:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:41:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:41:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:41:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:41:59,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:41:59,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:41:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:41:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:41:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:41:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:41:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:41:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:41:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:41:59,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:41:59,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:41:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:41:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:41:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:41:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:41:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:41:59,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:41:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:41:59,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:41:59,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:41:59,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378586259] [2024-11-20 02:41:59,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378586259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:41:59,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:41:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 02:41:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121221600] [2024-11-20 02:41:59,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:41:59,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 02:41:59,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:41:59,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 02:41:59,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-11-20 02:41:59,829 INFO L87 Difference]: Start difference. First operand 179 states and 263 transitions. Second operand has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:42:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:00,715 INFO L93 Difference]: Finished difference Result 247 states and 349 transitions. [2024-11-20 02:42:00,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 02:42:00,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-20 02:42:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:00,718 INFO L225 Difference]: With dead ends: 247 [2024-11-20 02:42:00,718 INFO L226 Difference]: Without dead ends: 245 [2024-11-20 02:42:00,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-20 02:42:00,720 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 142 mSDsluCounter, 718 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:00,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 874 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:42:00,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2024-11-20 02:42:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 199. [2024-11-20 02:42:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 132 states have (on average 1.2954545454545454) internal successors, (171), 134 states have internal predecessors, (171), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 02:42:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 291 transitions. [2024-11-20 02:42:00,753 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 291 transitions. Word has length 173 [2024-11-20 02:42:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:00,755 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 291 transitions. [2024-11-20 02:42:00,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.769230769230769) internal successors, (36), 13 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:42:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 291 transitions. [2024-11-20 02:42:00,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 02:42:00,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:00,757 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:00,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:42:00,758 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:00,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:00,758 INFO L85 PathProgramCache]: Analyzing trace with hash 892353706, now seen corresponding path program 1 times [2024-11-20 02:42:00,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:00,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610085840] [2024-11-20 02:42:00,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:00,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:42:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:42:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:42:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:42:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-20 02:42:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:42:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-20 02:42:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:42:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:42:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:42:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:42:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 02:42:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:42:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 02:42:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:42:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 02:42:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-20 02:42:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 02:42:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-20 02:42:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 02:42:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-20 02:42:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 02:42:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-20 02:42:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 02:42:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-20 02:42:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-20 02:42:00,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-20 02:42:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-20 02:42:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 02:42:00,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610085840] [2024-11-20 02:42:00,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610085840] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:42:00,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649642366] [2024-11-20 02:42:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:00,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:42:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:42:00,966 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:42:00,967 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:42:01,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:01,077 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 02:42:01,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:01,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 02:42:01,179 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:42:01,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 75 proven. 6 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-20 02:42:01,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [649642366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 02:42:01,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 02:42:01,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 02:42:01,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719342458] [2024-11-20 02:42:01,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 02:42:01,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:42:01,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:01,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:42:01,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 02:42:01,376 INFO L87 Difference]: Start difference. First operand 199 states and 291 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-20 02:42:01,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:01,621 INFO L93 Difference]: Finished difference Result 405 states and 587 transitions. [2024-11-20 02:42:01,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 02:42:01,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 174 [2024-11-20 02:42:01,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:01,625 INFO L225 Difference]: With dead ends: 405 [2024-11-20 02:42:01,625 INFO L226 Difference]: Without dead ends: 209 [2024-11-20 02:42:01,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 400 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:42:01,632 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 128 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:01,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 165 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 02:42:01,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-20 02:42:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 196. [2024-11-20 02:42:01,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 127 states have (on average 1.220472440944882) internal successors, (155), 129 states have internal predecessors, (155), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 02:42:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 275 transitions. [2024-11-20 02:42:01,666 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 275 transitions. Word has length 174 [2024-11-20 02:42:01,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:01,667 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 275 transitions. [2024-11-20 02:42:01,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 8 states have internal predecessors, (59), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-20 02:42:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 275 transitions. [2024-11-20 02:42:01,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:42:01,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:01,670 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:01,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 02:42:01,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-20 02:42:01,871 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:01,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1654830299, now seen corresponding path program 1 times [2024-11-20 02:42:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579211639] [2024-11-20 02:42:01,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:01,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:01,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:42:01,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [918383342] [2024-11-20 02:42:01,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:01,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:42:01,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:42:01,924 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:42:01,929 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:42:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:02,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 02:42:02,511 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-20 02:42:03,302 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:42:03,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:42:03,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579211639] [2024-11-20 02:42:03,506 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-20 02:42:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918383342] [2024-11-20 02:42:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918383342] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:42:03,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-20 02:42:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-11-20 02:42:03,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996695370] [2024-11-20 02:42:03,508 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-20 02:42:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:42:03,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:42:03,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:42:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:42:03,510 INFO L87 Difference]: Start difference. First operand 196 states and 275 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:42:04,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:04,179 INFO L93 Difference]: Finished difference Result 419 states and 581 transitions. [2024-11-20 02:42:04,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 02:42:04,180 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2024-11-20 02:42:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:04,183 INFO L225 Difference]: With dead ends: 419 [2024-11-20 02:42:04,183 INFO L226 Difference]: Without dead ends: 226 [2024-11-20 02:42:04,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-20 02:42:04,188 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 106 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:04,188 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 399 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 02:42:04,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-20 02:42:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 204. [2024-11-20 02:42:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 134 states have (on average 1.2164179104477613) internal successors, (163), 136 states have internal predecessors, (163), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 58 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 02:42:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2024-11-20 02:42:04,258 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 175 [2024-11-20 02:42:04,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:04,259 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2024-11-20 02:42:04,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 7 states have internal predecessors, (44), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:42:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2024-11-20 02:42:04,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-20 02:42:04,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:04,261 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:04,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 02:42:04,461 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,SelfDestructingSolverStorable6 [2024-11-20 02:42:04,462 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:04,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:04,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1629019747, now seen corresponding path program 1 times [2024-11-20 02:42:04,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:42:04,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233835095] [2024-11-20 02:42:04,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:04,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:42:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:42:04,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [809751270] [2024-11-20 02:42:04,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:04,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:42:04,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:42:04,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 02:42:04,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 02:42:04,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:42:04,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:42:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:42:05,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:42:05,062 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:42:05,064 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:42:05,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 02:42:05,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:42:05,269 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:42:05,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:42:05,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:42:05 BoogieIcfgContainer [2024-11-20 02:42:05,384 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:42:05,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:42:05,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:42:05,385 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:42:05,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:41:14" (3/4) ... [2024-11-20 02:42:05,388 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:42:05,389 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:42:05,390 INFO L158 Benchmark]: Toolchain (without parser) took 51624.89ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 78.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 48.8MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,390 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 132.1MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:42:05,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 403.72ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 61.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.07ms. Allocated memory is still 132.1MB. Free memory was 61.8MB in the beginning and 102.6MB in the end (delta: -40.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,391 INFO L158 Benchmark]: Boogie Preprocessor took 106.62ms. Allocated memory is still 132.1MB. Free memory was 102.6MB in the beginning and 96.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,392 INFO L158 Benchmark]: RCFGBuilder took 601.38ms. Allocated memory is still 132.1MB. Free memory was 96.3MB in the beginning and 72.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,392 INFO L158 Benchmark]: TraceAbstraction took 50407.31ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. [2024-11-20 02:42:05,394 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:42:05,395 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.17ms. Allocated memory is still 132.1MB. Free memory is still 93.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 403.72ms. Allocated memory is still 132.1MB. Free memory was 78.1MB in the beginning and 61.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.07ms. Allocated memory is still 132.1MB. Free memory was 61.8MB in the beginning and 102.6MB in the end (delta: -40.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.62ms. Allocated memory is still 132.1MB. Free memory was 102.6MB in the beginning and 96.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 601.38ms. Allocated memory is still 132.1MB. Free memory was 96.3MB in the beginning and 72.7MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 50407.31ms. Allocated memory was 132.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 72.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 43.7MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 1.2GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 1.0MB). 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 140. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 16; [L25] unsigned char var_1_4 = 4; [L26] unsigned char var_1_5 = 200; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 0; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] signed short int var_1_10 = 128; [L32] signed short int var_1_11 = 5; [L33] signed char var_1_12 = -2; [L34] signed char var_1_13 = -32; [L35] signed char var_1_14 = 2; [L36] signed char var_1_15 = 25; [L37] signed char var_1_16 = 1; [L38] signed char var_1_17 = 0; [L39] signed long int var_1_18 = -16; [L40] float var_1_19 = 2.775; [L41] unsigned long int var_1_20 = 2381110720; [L42] float var_1_21 = 10000000000000.5; VAL [isInitial=0, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_2=25, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L144] isInitial = 1 [L145] FCALL initially() [L146] COND TRUE 1 [L147] FCALL updateLastVariables() [L148] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=16, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L97] var_1_3 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L98] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_4=4, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=200, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=1, var_1_7=0, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_7=0, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L113] var_1_8 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L114] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_9=0] [L115] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L115] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=0] [L116] var_1_9 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L118] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=-32, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L119] var_1_13 = __VERIFIER_nondet_char() [L120] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L120] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L121] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L121] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=2, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L122] var_1_14 = __VERIFIER_nondet_char() [L123] CALL assume_abort_if_not(var_1_14 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L123] RET assume_abort_if_not(var_1_14 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L124] CALL assume_abort_if_not(var_1_14 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L124] RET assume_abort_if_not(var_1_14 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=1, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L125] var_1_16 = __VERIFIER_nondet_char() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L127] CALL assume_abort_if_not(var_1_16 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L127] RET assume_abort_if_not(var_1_16 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=0, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L129] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=2381110720, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L131] var_1_20 = __VERIFIER_nondet_ulong() [L132] CALL assume_abort_if_not(var_1_20 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L132] RET assume_abort_if_not(var_1_20 >= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L133] CALL assume_abort_if_not(var_1_20 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L133] RET assume_abort_if_not(var_1_20 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_21=20000000000001/2, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=0, var_1_20=-133985768, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L148] RET updateVariables() [L149] CALL step() [L46] COND FALSE !((var_1_2 / var_1_3) <= 2) [L57] var_1_1 = var_1_5 VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L59] unsigned char stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=32, var_1_10=128, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L60] COND TRUE stepLocal_0 <= var_1_2 [L61] var_1_10 = ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))) VAL [isInitial=1, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L63] signed long int stepLocal_1 = ((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=5, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L64] COND TRUE var_1_1 >= stepLocal_1 [L65] var_1_11 = ((var_1_5 + var_1_2) + var_1_3) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=-2, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L71] var_1_12 = ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=25, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L72] COND TRUE \read(var_1_7) [L73] var_1_15 = (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L75] signed char stepLocal_2 = var_1_16; VAL [isInitial=1, stepLocal_2=32, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=-16, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L76] COND TRUE stepLocal_2 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3))) [L77] var_1_18 = (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L81] COND TRUE 100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L82] COND TRUE var_1_20 > 1u VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=111/40, var_1_1=-256, var_1_20=-133985768, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L83] COND TRUE \read(var_1_9) [L84] var_1_19 = var_1_21 VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L149] RET step() [L150] CALL, EXPR property() [L140-L141] return ((((((((var_1_2 / var_1_3) <= 2) ? ((var_1_3 < (((((~ var_1_2)) < (var_1_4)) ? ((~ var_1_2)) : (var_1_4)))) ? (var_1_1 == ((unsigned char) ((((var_1_5) < (16)) ? (var_1_5) : (16))))) : ((((var_1_6 || var_1_7) && var_1_8) || var_1_9) ? (var_1_1 == ((unsigned char) var_1_5)) : (var_1_1 == ((unsigned char) var_1_5)))) : (var_1_1 == ((unsigned char) var_1_5))) && ((var_1_3 <= var_1_2) ? (var_1_10 == ((signed short int) ((((var_1_5) < (var_1_3)) ? (var_1_5) : (var_1_3))))) : 1)) && ((var_1_1 >= (((((var_1_2) < (var_1_10)) ? (var_1_2) : (var_1_10))) + var_1_5)) ? (var_1_11 == ((signed short int) ((var_1_5 + var_1_2) + var_1_3))) : (var_1_8 ? (var_1_11 == ((signed short int) var_1_3)) : 1))) && (var_1_12 == ((signed char) ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14)))))) && (var_1_7 ? (var_1_15 == ((signed char) (((((32) < ((16 + var_1_16))) ? (32) : ((16 + var_1_16)))) - var_1_17))) : 1)) && ((var_1_16 <= ((((var_1_13) > (var_1_3)) ? (var_1_13) : (var_1_3)))) ? (var_1_18 == ((signed long int) (((((64 - var_1_16)) > (var_1_17)) ? ((64 - var_1_16)) : (var_1_17))))) : (var_1_18 == ((signed long int) 4)))) && ((100000000u < (((((4160981528u) < (var_1_20)) ? (4160981528u) : (var_1_20))) - var_1_1)) ? ((var_1_20 > 1u) ? (var_1_9 ? (var_1_19 == ((float) var_1_21)) : (var_1_19 == ((float) var_1_21))) : (var_1_19 == ((float) var_1_21))) : 1) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L150] RET, EXPR property() [L150] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=128, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=32, var_1_17=32, var_1_18=32, var_1_19=2, var_1_1=-256, var_1_20=-133985768, var_1_21=2, var_1_2=-160, var_1_3=32, var_1_5=-256, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=-255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.2s, OverallIterations: 8, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 976 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 949 mSDsluCounter, 3485 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2710 mSDsCounter, 158 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2097 IncrementalHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 158 mSolverCounterUnsat, 775 mSDtfsCounter, 2097 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1004 GetRequests, 906 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=204occurred in iteration=7, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 7 MinimizatonAttempts, 176 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 38.2s InterpolantComputationTime, 1913 NumberOfCodeBlocks, 1913 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1553 ConstructedInterpolants, 4 QuantifiedInterpolants, 11173 SizeOfPredicates, 4 NumberOfNonLiveVariables, 757 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 13521/13608 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:42:05,614 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-20 02:42:05,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 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_steplocals_file-58.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 cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:42:07,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:42:07,878 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:42:07,884 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:42:07,885 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:42:07,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:42:07,933 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:42:07,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:42:07,934 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:42:07,935 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:42:07,936 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:42:07,936 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:42:07,937 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:42:07,937 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:42:07,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:42:07,939 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:42:07,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:42:07,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:42:07,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:42:07,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:42:07,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:42:07,944 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:42:07,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:42:07,945 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:42:07,945 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:42:07,945 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:42:07,946 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:42:07,946 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:42:07,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:42:07,946 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:42:07,946 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:42:07,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:42:07,947 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:42:07,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:42:07,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:42:07,948 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:42:07,948 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:42:07,948 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:42:07,949 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:42:07,949 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:42:07,950 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:42:07,950 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:42:07,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:42:07,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:42:07,951 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 -> cfa1db2b7b11c8a5c678532d9720edadc9dcf8095da3555b92876b462fef0528 [2024-11-20 02:42:08,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:42:08,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:42:08,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:42:08,325 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:42:08,326 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:42:08,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-20 02:42:10,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:42:10,252 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:42:10,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-58.i [2024-11-20 02:42:10,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581de6efd/4a2e180bb7384020bc7485e4ee96efe4/FLAGf9ddda681 [2024-11-20 02:42:10,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/581de6efd/4a2e180bb7384020bc7485e4ee96efe4 [2024-11-20 02:42:10,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:42:10,583 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:42:10,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:42:10,587 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:42:10,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:42:10,593 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,594 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@266dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:10, skipping insertion in model container [2024-11-20 02:42:10,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:42:10" (1/1) ... [2024-11-20 02:42:10,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:42:10,820 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_steplocals_file-58.i[917,930] [2024-11-20 02:42:10,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:42:10,935 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:42:10,949 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_steplocals_file-58.i[917,930] [2024-11-20 02:42:10,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:42:11,020 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:42:11,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11 WrapperNode [2024-11-20 02:42:11,021 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:42:11,022 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:42:11,022 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:42:11,022 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:42:11,028 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:42:11" (1/1) ... [2024-11-20 02:42:11,037 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:42:11" (1/1) ... [2024-11-20 02:42:11,081 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-20 02:42:11,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:42:11,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:42:11,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:42:11,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:42:11,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,129 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:42:11,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,130 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,146 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,159 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,161 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,170 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:42:11,171 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:42:11,171 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:42:11,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:42:11,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (1/1) ... [2024-11-20 02:42:11,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:42:11,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:42:11,225 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:42:11,228 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:42:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:42:11,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:42:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:42:11,269 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:42:11,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:42:11,269 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:42:11,349 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:42:11,353 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:42:11,811 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 02:42:11,812 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:42:11,830 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:42:11,830 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:42:11,830 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:11 BoogieIcfgContainer [2024-11-20 02:42:11,830 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:42:11,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:42:11,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:42:11,837 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:42:11,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:42:10" (1/3) ... [2024-11-20 02:42:11,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e42b868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:11, skipping insertion in model container [2024-11-20 02:42:11,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:42:11" (2/3) ... [2024-11-20 02:42:11,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e42b868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:42:11, skipping insertion in model container [2024-11-20 02:42:11,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:42:11" (3/3) ... [2024-11-20 02:42:11,840 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-58.i [2024-11-20 02:42:11,867 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:42:11,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:42:11,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:42:11,957 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;@140db1a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:42:11,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:42:11,962 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:42:11,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:42:11,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:11,981 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:11,981 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:11,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:11,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1900470490, now seen corresponding path program 1 times [2024-11-20 02:42:11,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:42:11,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603697030] [2024-11-20 02:42:11,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:12,000 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:42:12,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:42:12,001 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:42:12,003 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:42:12,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:42:12,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 850 trivial. 0 not checked. [2024-11-20 02:42:12,341 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:42:12,342 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:42:12,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603697030] [2024-11-20 02:42:12,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603697030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:42:12,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:42:12,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:42:12,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252126904] [2024-11-20 02:42:12,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:12,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:42:12,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:42:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:42:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:42:12,378 INFO L87 Difference]: Start difference. First operand has 76 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 46 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:42:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:12,406 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2024-11-20 02:42:12,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:42:12,408 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 173 [2024-11-20 02:42:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:12,416 INFO L225 Difference]: With dead ends: 145 [2024-11-20 02:42:12,416 INFO L226 Difference]: Without dead ends: 72 [2024-11-20 02:42:12,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 172 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:42:12,423 INFO L432 NwaCegarLoop]: 109 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, 109 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:42:12,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:42:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-11-20 02:42:12,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-11-20 02:42:12,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 42 states have internal predecessors, (53), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:42:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 109 transitions. [2024-11-20 02:42:12,472 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 109 transitions. Word has length 173 [2024-11-20 02:42:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:12,473 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 109 transitions. [2024-11-20 02:42:12,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-20 02:42:12,474 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 109 transitions. [2024-11-20 02:42:12,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:42:12,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:12,481 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:12,492 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:42:12,682 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:42:12,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:12,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:12,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1011697190, now seen corresponding path program 1 times [2024-11-20 02:42:12,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:42:12,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [921286737] [2024-11-20 02:42:12,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:12,685 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:42:12,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:42:12,687 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:42:12,690 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:42:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:12,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 02:42:12,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:13,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 403 proven. 69 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2024-11-20 02:42:13,635 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:42:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-20 02:42:13,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:42:13,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [921286737] [2024-11-20 02:42:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [921286737] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-20 02:42:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-20 02:42:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2024-11-20 02:42:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119298713] [2024-11-20 02:42:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:42:13,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 02:42:13,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:42:13,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 02:42:13,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:42:13,974 INFO L87 Difference]: Start difference. First operand 72 states and 109 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:42:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:42:14,132 INFO L93 Difference]: Finished difference Result 161 states and 243 transitions. [2024-11-20 02:42:14,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 02:42:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 173 [2024-11-20 02:42:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:42:14,139 INFO L225 Difference]: With dead ends: 161 [2024-11-20 02:42:14,139 INFO L226 Difference]: Without dead ends: 92 [2024-11-20 02:42:14,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-20 02:42:14,149 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 28 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:42:14,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 280 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:42:14,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-20 02:42:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 74. [2024-11-20 02:42:14,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:42:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 111 transitions. [2024-11-20 02:42:14,170 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 111 transitions. Word has length 173 [2024-11-20 02:42:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:42:14,178 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 111 transitions. [2024-11-20 02:42:14,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-20 02:42:14,179 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 111 transitions. [2024-11-20 02:42:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-20 02:42:14,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:42:14,188 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:14,216 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 (3)] Ended with exit code 0 [2024-11-20 02:42:14,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:42:14,389 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:42:14,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:42:14,390 INFO L85 PathProgramCache]: Analyzing trace with hash 753531752, now seen corresponding path program 1 times [2024-11-20 02:42:14,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:42:14,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153947816] [2024-11-20 02:42:14,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:14,391 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:42:14,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:42:14,395 INFO L229 MonitoredProcess]: Starting monitored process 4 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:42:14,396 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 (4)] Waiting until timeout for monitored process [2024-11-20 02:42:14,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:14,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 02:42:14,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 02:42:14,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:42:14,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:42:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153947816] [2024-11-20 02:42:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153947816] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:42:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [629109080] [2024-11-20 02:42:14,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:42:14,786 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:42:14,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:42:14,789 INFO L229 MonitoredProcess]: Starting monitored process 5 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:42:14,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 02:42:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:42:16,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-20 02:42:16,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:42:19,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 277 proven. 6 refuted. 0 times theorem prover too weak. 1229 trivial. 0 not checked. [2024-11-20 02:42:19,271 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:42:20,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [629109080] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:42:20,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:42:20,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 11 [2024-11-20 02:42:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559130501] [2024-11-20 02:42:20,105 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:42:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 02:42:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:42:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 02:42:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2024-11-20 02:42:20,107 INFO L87 Difference]: Start difference. First operand 74 states and 111 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 2 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)