./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_fillercode_fillercodestructure_filler-pr-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_fillercode_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:43:44,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:43:44,765 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:43:44,771 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:43:44,772 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:43:44,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:43:44,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:43:44,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:43:44,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:43:44,805 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:43:44,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:43:44,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:43:44,806 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:43:44,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:43:44,807 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:43:44,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:43:44,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:43:44,810 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:43:44,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:43:44,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:43:44,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:43:44,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:43:44,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:43:44,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:43:44,812 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:43:44,813 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:43:44,813 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:43:44,813 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:43:44,814 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:43:44,814 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:43:44,814 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:43:44,815 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:43:44,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:43:44,815 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:43:44,816 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:43:44,816 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:43:44,816 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:43:44,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:43:44,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:43:44,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:43:44,818 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:43:44,818 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:43:44,818 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-10-14 09:43:45,060 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:43:45,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:43:45,090 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:43:45,091 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:43:45,092 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:43:45,093 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:43:46,586 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:43:46,779 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:43:46,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:43:46,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0092cb359/b9f5df9b318843f38513b9b9f44fe847/FLAG53f933a49 [2024-10-14 09:43:46,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0092cb359/b9f5df9b318843f38513b9b9f44fe847 [2024-10-14 09:43:46,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:43:46,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:43:46,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:43:46,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:43:46,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:43:46,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:43:46" (1/1) ... [2024-10-14 09:43:46,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab7c7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:46, skipping insertion in model container [2024-10-14 09:43:46,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:43:46" (1/1) ... [2024-10-14 09:43:46,853 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:43:47,002 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-10-14 09:43:47,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:43:47,100 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:43:47,112 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-10-14 09:43:47,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:43:47,185 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:43:47,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47 WrapperNode [2024-10-14 09:43:47,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:43:47,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:43:47,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:43:47,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:43:47,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,207 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,258 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-10-14 09:43:47,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:43:47,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:43:47,260 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:43:47,260 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:43:47,271 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,302 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-10-14 09:43:47,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,320 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,329 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,346 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:43:47,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:43:47,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:43:47,357 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:43:47,357 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (1/1) ... [2024-10-14 09:43:47,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:43:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:43:47,393 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-10-14 09:43:47,396 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-10-14 09:43:47,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:43:47,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:43:47,449 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:43:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:43:47,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:43:47,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:43:47,547 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:43:47,549 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:43:48,171 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-14 09:43:48,171 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:43:48,207 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:43:48,208 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:43:48,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:43:48 BoogieIcfgContainer [2024-10-14 09:43:48,209 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:43:48,210 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:43:48,211 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:43:48,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:43:48,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:43:46" (1/3) ... [2024-10-14 09:43:48,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6fad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:43:48, skipping insertion in model container [2024-10-14 09:43:48,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:43:47" (2/3) ... [2024-10-14 09:43:48,216 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ff6fad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:43:48, skipping insertion in model container [2024-10-14 09:43:48,216 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:43:48" (3/3) ... [2024-10-14 09:43:48,217 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:43:48,235 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:43:48,236 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:43:48,296 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:43:48,302 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;@e7d0764, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:43:48,302 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:43:48,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 78 states have internal predecessors, (120), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:43:48,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 09:43:48,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:48,326 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:48,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:48,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 649403876, now seen corresponding path program 1 times [2024-10-14 09:43:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189692145] [2024-10-14 09:43:48,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:48,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:48,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:48,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:48,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:48,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:48,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:48,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189692145] [2024-10-14 09:43:48,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189692145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:48,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:48,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:43:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377098535] [2024-10-14 09:43:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:48,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:43:48,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:48,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:43:48,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:43:48,799 INFO L87 Difference]: Start difference. First operand has 100 states, 77 states have (on average 1.5584415584415585) internal successors, (120), 78 states have internal predecessors, (120), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 09:43:48,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:48,853 INFO L93 Difference]: Finished difference Result 197 states and 338 transitions. [2024-10-14 09:43:48,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:43:48,856 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 136 [2024-10-14 09:43:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:48,866 INFO L225 Difference]: With dead ends: 197 [2024-10-14 09:43:48,866 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 09:43:48,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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-10-14 09:43:48,876 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:48,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:43:48,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 09:43:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 09:43:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.486842105263158) internal successors, (113), 76 states have internal predecessors, (113), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:43:48,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 153 transitions. [2024-10-14 09:43:48,923 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 153 transitions. Word has length 136 [2024-10-14 09:43:48,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:48,923 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 153 transitions. [2024-10-14 09:43:48,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 09:43:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 153 transitions. [2024-10-14 09:43:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 09:43:48,929 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:48,929 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:48,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:43:48,930 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:48,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:48,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1077388324, now seen corresponding path program 1 times [2024-10-14 09:43:48,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:48,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947898226] [2024-10-14 09:43:48,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:48,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:49,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:49,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:49,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:49,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:49,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:49,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:49,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947898226] [2024-10-14 09:43:49,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947898226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:49,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:49,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:43:49,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926969267] [2024-10-14 09:43:49,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:49,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:43:49,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:49,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:43:49,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:43:49,308 INFO L87 Difference]: Start difference. First operand 98 states and 153 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:49,451 INFO L93 Difference]: Finished difference Result 274 states and 427 transitions. [2024-10-14 09:43:49,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:43:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-14 09:43:49,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:49,457 INFO L225 Difference]: With dead ends: 274 [2024-10-14 09:43:49,460 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 09:43:49,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:43:49,462 INFO L432 NwaCegarLoop]: 251 mSDtfsCounter, 133 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:49,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 359 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:43:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 09:43:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 131. [2024-10-14 09:43:49,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 109 states have internal predecessors, (161), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:43:49,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 201 transitions. [2024-10-14 09:43:49,500 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 201 transitions. Word has length 136 [2024-10-14 09:43:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:49,503 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 201 transitions. [2024-10-14 09:43:49,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 201 transitions. [2024-10-14 09:43:49,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-10-14 09:43:49,506 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:49,506 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:43:49,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:49,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:49,510 INFO L85 PathProgramCache]: Analyzing trace with hash 349367392, now seen corresponding path program 1 times [2024-10-14 09:43:49,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:49,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866069643] [2024-10-14 09:43:49,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:49,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:49,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:49,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:49,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:49,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:50,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:50,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:50,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:50,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866069643] [2024-10-14 09:43:50,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866069643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:50,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:50,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:43:50,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900966151] [2024-10-14 09:43:50,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:50,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:43:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:43:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:43:50,045 INFO L87 Difference]: Start difference. First operand 131 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:50,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:50,435 INFO L93 Difference]: Finished difference Result 420 states and 647 transitions. [2024-10-14 09:43:50,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:43:50,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-10-14 09:43:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:50,439 INFO L225 Difference]: With dead ends: 420 [2024-10-14 09:43:50,439 INFO L226 Difference]: Without dead ends: 290 [2024-10-14 09:43:50,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:43:50,441 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 152 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:50,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 485 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:43:50,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2024-10-14 09:43:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 248. [2024-10-14 09:43:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 205 states have (on average 1.448780487804878) internal successors, (297), 205 states have internal predecessors, (297), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 09:43:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 377 transitions. [2024-10-14 09:43:50,487 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 377 transitions. Word has length 136 [2024-10-14 09:43:50,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:50,488 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 377 transitions. [2024-10-14 09:43:50,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:50,488 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 377 transitions. [2024-10-14 09:43:50,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-10-14 09:43:50,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:50,492 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:50,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:43:50,492 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:50,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1213952040, now seen corresponding path program 1 times [2024-10-14 09:43:50,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:50,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332961655] [2024-10-14 09:43:50,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:50,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:50,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:51,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:51,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:51,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:51,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:51,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:51,259 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:51,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:51,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332961655] [2024-10-14 09:43:51,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332961655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:51,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:51,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 09:43:51,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224882245] [2024-10-14 09:43:51,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:51,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:43:51,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:51,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:43:51,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:43:51,262 INFO L87 Difference]: Start difference. First operand 248 states and 377 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:51,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:51,712 INFO L93 Difference]: Finished difference Result 645 states and 971 transitions. [2024-10-14 09:43:51,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:43:51,713 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-10-14 09:43:51,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:51,717 INFO L225 Difference]: With dead ends: 645 [2024-10-14 09:43:51,717 INFO L226 Difference]: Without dead ends: 398 [2024-10-14 09:43:51,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:43:51,722 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 303 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:51,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 452 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:43:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-14 09:43:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 375. [2024-10-14 09:43:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 311 states have (on average 1.4019292604501608) internal successors, (436), 311 states have internal predecessors, (436), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:43:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 556 transitions. [2024-10-14 09:43:51,764 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 556 transitions. Word has length 137 [2024-10-14 09:43:51,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:51,766 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 556 transitions. [2024-10-14 09:43:51,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 556 transitions. [2024-10-14 09:43:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-10-14 09:43:51,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:51,769 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:51,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:43:51,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2049437269, now seen corresponding path program 1 times [2024-10-14 09:43:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47466108] [2024-10-14 09:43:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:52,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:52,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:52,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:52,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:52,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:52,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:52,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,157 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:52,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:52,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47466108] [2024-10-14 09:43:52,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47466108] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:52,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:52,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:43:52,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093810983] [2024-10-14 09:43:52,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:52,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:43:52,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:52,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:43:52,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:43:52,160 INFO L87 Difference]: Start difference. First operand 375 states and 556 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:52,217 INFO L93 Difference]: Finished difference Result 789 states and 1172 transitions. [2024-10-14 09:43:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:43:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 138 [2024-10-14 09:43:52,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:52,221 INFO L225 Difference]: With dead ends: 789 [2024-10-14 09:43:52,221 INFO L226 Difference]: Without dead ends: 415 [2024-10-14 09:43:52,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:43:52,224 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 100 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:52,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 511 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:43:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-10-14 09:43:52,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2024-10-14 09:43:52,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 311 states have (on average 1.3762057877813505) internal successors, (428), 311 states have internal predecessors, (428), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:43:52,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 548 transitions. [2024-10-14 09:43:52,258 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 548 transitions. Word has length 138 [2024-10-14 09:43:52,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:52,258 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 548 transitions. [2024-10-14 09:43:52,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 548 transitions. [2024-10-14 09:43:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 09:43:52,260 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:52,260 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:52,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:43:52,261 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:52,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:52,261 INFO L85 PathProgramCache]: Analyzing trace with hash 244122794, now seen corresponding path program 1 times [2024-10-14 09:43:52,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:52,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057934641] [2024-10-14 09:43:52,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:52,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:52,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:52,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:52,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:52,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:52,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:52,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:52,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:52,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,450 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:52,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:52,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057934641] [2024-10-14 09:43:52,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057934641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:52,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:52,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:43:52,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366589613] [2024-10-14 09:43:52,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:52,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:43:52,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:52,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:43:52,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:43:52,453 INFO L87 Difference]: Start difference. First operand 375 states and 548 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:52,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:52,490 INFO L93 Difference]: Finished difference Result 750 states and 1097 transitions. [2024-10-14 09:43:52,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:43:52,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-10-14 09:43:52,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:52,493 INFO L225 Difference]: With dead ends: 750 [2024-10-14 09:43:52,494 INFO L226 Difference]: Without dead ends: 376 [2024-10-14 09:43:52,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:43:52,499 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:52,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 290 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:43:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-14 09:43:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-14 09:43:52,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 312 states have (on average 1.3685897435897436) internal successors, (427), 312 states have internal predecessors, (427), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:43:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 547 transitions. [2024-10-14 09:43:52,526 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 547 transitions. Word has length 141 [2024-10-14 09:43:52,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:52,526 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 547 transitions. [2024-10-14 09:43:52,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 547 transitions. [2024-10-14 09:43:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-10-14 09:43:52,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:52,529 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:43:52,529 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1035740884, now seen corresponding path program 1 times [2024-10-14 09:43:52,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:52,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398082376] [2024-10-14 09:43:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:43:52,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:43:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:43:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:43:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:43:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:43:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:43:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:43:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:43:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:43:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:43:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:43:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:43:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:43:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:43:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:43:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:43:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:43:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:43:52,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:43:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:43:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:43:52,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:43:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398082376] [2024-10-14 09:43:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398082376] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:43:52,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:43:52,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:43:52,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118367881] [2024-10-14 09:43:52,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:43:52,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:43:52,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:43:52,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:43:52,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:43:52,774 INFO L87 Difference]: Start difference. First operand 376 states and 547 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:53,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:43:53,260 INFO L93 Difference]: Finished difference Result 646 states and 953 transitions. [2024-10-14 09:43:53,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:43:53,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-10-14 09:43:53,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:43:53,265 INFO L225 Difference]: With dead ends: 646 [2024-10-14 09:43:53,265 INFO L226 Difference]: Without dead ends: 515 [2024-10-14 09:43:53,266 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:43:53,267 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 258 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:43:53,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 713 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:43:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-14 09:43:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 397. [2024-10-14 09:43:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 333 states have (on average 1.3783783783783783) internal successors, (459), 333 states have internal predecessors, (459), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-14 09:43:53,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 579 transitions. [2024-10-14 09:43:53,319 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 579 transitions. Word has length 141 [2024-10-14 09:43:53,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:43:53,320 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 579 transitions. [2024-10-14 09:43:53,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:43:53,321 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 579 transitions. [2024-10-14 09:43:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 09:43:53,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:43:53,322 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:43:53,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:43:53,323 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:43:53,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:43:53,323 INFO L85 PathProgramCache]: Analyzing trace with hash -2038831618, now seen corresponding path program 1 times [2024-10-14 09:43:53,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:43:53,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479259754] [2024-10-14 09:43:53,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:43:53,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:43:53,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:44:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:44:05,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:44:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-14 09:44:05,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:44:05,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-14 09:44:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:44:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 09:44:05,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:44:05,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-14 09:44:05,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:44:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 09:44:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:44:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 09:44:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:44:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 09:44:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-14 09:44:05,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:44:05,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:44:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:44:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:44:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:44:05,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479259754] [2024-10-14 09:44:05,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479259754] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:44:05,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:44:05,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 09:44:05,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459753086] [2024-10-14 09:44:05,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:44:05,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:44:05,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:44:05,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:44:05,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:44:05,783 INFO L87 Difference]: Start difference. First operand 397 states and 579 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:44:10,654 INFO L93 Difference]: Finished difference Result 1057 states and 1521 transitions. [2024-10-14 09:44:10,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 09:44:10,656 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-10-14 09:44:10,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:44:10,660 INFO L225 Difference]: With dead ends: 1057 [2024-10-14 09:44:10,660 INFO L226 Difference]: Without dead ends: 788 [2024-10-14 09:44:10,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:44:10,662 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 143 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:44:10,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 527 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 09:44:10,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2024-10-14 09:44:10,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 721. [2024-10-14 09:44:10,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 648 states have (on average 1.3919753086419753) internal successors, (902), 651 states have internal predecessors, (902), 66 states have call successors, (66), 6 states have call predecessors, (66), 6 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 09:44:10,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 1034 transitions. [2024-10-14 09:44:10,754 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 1034 transitions. Word has length 142 [2024-10-14 09:44:10,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:44:10,755 INFO L471 AbstractCegarLoop]: Abstraction has 721 states and 1034 transitions. [2024-10-14 09:44:10,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:10,756 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 1034 transitions. [2024-10-14 09:44:10,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-10-14 09:44:10,757 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:10,757 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:10,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 09:44:10,758 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:10,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:10,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1746662588, now seen corresponding path program 1 times [2024-10-14 09:44:10,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:44:10,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945942615] [2024-10-14 09:44:10,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:10,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:44:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:44:10,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465926444] [2024-10-14 09:44:10,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:10,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:44:10,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:44:10,830 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-10-14 09:44:10,831 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-10-14 09:44:11,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:44:11,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:44:11,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:44:11,232 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:44:11,233 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:44:11,234 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:44:11,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 09:44:11,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:44:11,440 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:44:11,558 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:44:11,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:44:11 BoogieIcfgContainer [2024-10-14 09:44:11,562 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:44:11,563 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:44:11,563 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:44:11,563 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:44:11,564 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:43:48" (3/4) ... [2024-10-14 09:44:11,566 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:44:11,567 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:44:11,567 INFO L158 Benchmark]: Toolchain (without parser) took 24758.96ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 104.4MB in the beginning and 151.6MB in the end (delta: -47.2MB). Peak memory consumption was 92.7MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,568 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:44:11,568 INFO L158 Benchmark]: CACSL2BoogieTranslator took 374.23ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 87.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,569 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.54ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 81.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,569 INFO L158 Benchmark]: Boogie Preprocessor took 94.86ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 72.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,569 INFO L158 Benchmark]: RCFGBuilder took 852.52ms. Allocated memory is still 159.4MB. Free memory was 72.9MB in the beginning and 99.2MB in the end (delta: -26.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,569 INFO L158 Benchmark]: TraceAbstraction took 23351.79ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 98.4MB in the beginning and 152.7MB in the end (delta: -54.3MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,570 INFO L158 Benchmark]: Witness Printer took 4.10ms. Allocated memory is still 297.8MB. Free memory was 152.7MB in the beginning and 151.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 09:44:11,571 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.18ms. Allocated memory is still 159.4MB. Free memory is still 120.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 374.23ms. Allocated memory is still 159.4MB. Free memory was 104.0MB in the beginning and 87.6MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.54ms. Allocated memory is still 159.4MB. Free memory was 87.6MB in the beginning and 81.4MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.86ms. Allocated memory is still 159.4MB. Free memory was 81.4MB in the beginning and 72.9MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 852.52ms. Allocated memory is still 159.4MB. Free memory was 72.9MB in the beginning and 99.2MB in the end (delta: -26.3MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * TraceAbstraction took 23351.79ms. Allocated memory was 159.4MB in the beginning and 297.8MB in the end (delta: 138.4MB). Free memory was 98.4MB in the beginning and 152.7MB in the end (delta: -54.3MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 4.10ms. Allocated memory is still 297.8MB. Free memory was 152.7MB in the beginning and 151.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 97. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L55] COND TRUE ((((var_1_13) < (var_1_14)) ? (var_1_13) : (var_1_14))) >= var_1_12 [L56] var_1_37 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L58] var_1_20 = var_1_8 [L59] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L60] COND TRUE (var_1_20 / var_1_12) < var_1_13 [L61] var_1_29 = var_1_12 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L65] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L72] var_1_38 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L74] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L77] COND FALSE !(\read(var_1_22)) [L82] var_1_24 = ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L84] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L87] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L88] COND FALSE !(\read(var_1_22)) [L95] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=100, var_1_5=5, var_1_8=0] [L97] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L104] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-255, var_1_12=63, var_1_13=-193, var_1_14=-192, var_1_15=0, var_1_16=-1, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=63, var_1_29=63, var_1_33=32767, var_1_35=4, var_1_37=64, var_1_38=-193, var_1_43=63, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.2s, OverallIterations: 9, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1089 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1089 mSDsluCounter, 3487 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2007 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1350 IncrementalHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 1480 mSDtfsCounter, 1350 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 394 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=721occurred in iteration=8, InterpolantAutomatonStates: 38, 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, 8 MinimizatonAttempts, 336 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.8s InterpolantComputationTime, 1391 NumberOfCodeBlocks, 1391 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1099 ConstructedInterpolants, 0 QuantifiedInterpolants, 14875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 6080/6080 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-10-14 09:44:11,688 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.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 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:44:13,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:44:13,995 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:44:14,003 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:44:14,003 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:44:14,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:44:14,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:44:14,042 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:44:14,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:44:14,043 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:44:14,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:44:14,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:44:14,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:44:14,045 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:44:14,045 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:44:14,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:44:14,046 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:44:14,046 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:44:14,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:44:14,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:44:14,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:44:14,052 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:44:14,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:44:14,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:44:14,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:44:14,053 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:44:14,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:44:14,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:44:14,054 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:44:14,054 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:44:14,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:44:14,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:44:14,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:44:14,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:44:14,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:44:14,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:44:14,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:44:14,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:44:14,059 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:44:14,059 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:44:14,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:44:14,060 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:44:14,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:44:14,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:44:14,060 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:44:14,061 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 -> 84a77ba55ab51f560e1bf3563bb3191090888d113bc8317dcee7de2867768a2d [2024-10-14 09:44:14,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:44:14,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:44:14,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:44:14,468 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:44:14,469 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:44:14,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:44:16,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:44:16,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:44:16,291 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:44:16,303 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b121e9c86/4ff01dacf8c4431393f2a35e10710a7c/FLAGed4cf1013 [2024-10-14 09:44:16,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b121e9c86/4ff01dacf8c4431393f2a35e10710a7c [2024-10-14 09:44:16,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:44:16,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:44:16,329 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:44:16,329 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:44:16,334 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:44:16,335 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a695807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16, skipping insertion in model container [2024-10-14 09:44:16,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,372 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:44:16,549 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-10-14 09:44:16,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:44:16,680 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:44:16,691 WARN L248 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_fillercode_fillercodestructure_filler-pr-ci_file-97.i[919,932] [2024-10-14 09:44:16,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:44:16,751 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:44:16,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16 WrapperNode [2024-10-14 09:44:16,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:44:16,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:44:16,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:44:16,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:44:16,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,819 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-10-14 09:44:16,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:44:16,820 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:44:16,820 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:44:16,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:44:16,831 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,832 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,840 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,863 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-10-14 09:44:16,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,888 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,893 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:44:16,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:44:16,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:44:16,902 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:44:16,905 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (1/1) ... [2024-10-14 09:44:16,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:44:16,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:44:16,937 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-10-14 09:44:16,939 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-10-14 09:44:16,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:44:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:44:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:44:16,978 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:44:16,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:44:16,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:44:17,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:44:17,071 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:44:23,752 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 09:44:23,752 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:44:23,828 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:44:23,828 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:44:23,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:44:23 BoogieIcfgContainer [2024-10-14 09:44:23,829 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:44:23,831 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:44:23,831 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:44:23,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:44:23,835 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:44:16" (1/3) ... [2024-10-14 09:44:23,835 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3887e597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:44:23, skipping insertion in model container [2024-10-14 09:44:23,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:44:16" (2/3) ... [2024-10-14 09:44:23,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3887e597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:44:23, skipping insertion in model container [2024-10-14 09:44:23,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:44:23" (3/3) ... [2024-10-14 09:44:23,837 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-97.i [2024-10-14 09:44:23,854 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:44:23,854 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:44:23,920 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:44:23,927 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;@7ea89b6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:44:23,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:44:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:44:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 09:44:23,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:23,956 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:23,957 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:23,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:23,963 INFO L85 PathProgramCache]: Analyzing trace with hash -590971721, now seen corresponding path program 1 times [2024-10-14 09:44:23,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:44:23,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547687346] [2024-10-14 09:44:23,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:23,976 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-10-14 09:44:23,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:44:23,979 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-10-14 09:44:23,995 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-10-14 09:44:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:24,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:44:24,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:44:24,457 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 390 proven. 0 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-14 09:44:24,460 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:44:24,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:44:24,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547687346] [2024-10-14 09:44:24,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547687346] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:44:24,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:44:24,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:44:24,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685004740] [2024-10-14 09:44:24,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:44:24,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:44:24,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:44:24,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:44:24,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:44:24,501 INFO L87 Difference]: Start difference. First operand has 69 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 47 states have internal predecessors, (71), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 09:44:24,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:44:24,576 INFO L93 Difference]: Finished difference Result 135 states and 240 transitions. [2024-10-14 09:44:24,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:44:24,582 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 132 [2024-10-14 09:44:24,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:44:24,592 INFO L225 Difference]: With dead ends: 135 [2024-10-14 09:44:24,592 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 09:44:24,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 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-10-14 09:44:24,602 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:44:24,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:44:24,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 09:44:24,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-10-14 09:44:24,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 45 states have internal predecessors, (65), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:44:24,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 105 transitions. [2024-10-14 09:44:24,670 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 105 transitions. Word has length 132 [2024-10-14 09:44:24,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:44:24,671 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 105 transitions. [2024-10-14 09:44:24,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-14 09:44:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 105 transitions. [2024-10-14 09:44:24,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 09:44:24,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:24,677 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:24,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:44:24,878 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-10-14 09:44:24,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:24,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:24,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2069329583, now seen corresponding path program 1 times [2024-10-14 09:44:24,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:44:24,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294147888] [2024-10-14 09:44:24,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:24,881 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-10-14 09:44:24,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:44:24,883 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-10-14 09:44:24,885 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-10-14 09:44:25,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:25,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:44:25,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:44:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-14 09:44:25,854 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:44:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-14 09:44:26,852 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:44:26,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294147888] [2024-10-14 09:44:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294147888] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:44:26,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:44:26,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-10-14 09:44:26,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918400963] [2024-10-14 09:44:26,854 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:44:26,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:44:26,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:44:26,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:44:26,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:44:26,859 INFO L87 Difference]: Start difference. First operand 67 states and 105 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 09:44:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:44:28,113 INFO L93 Difference]: Finished difference Result 138 states and 210 transitions. [2024-10-14 09:44:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 09:44:28,114 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 132 [2024-10-14 09:44:28,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:44:28,117 INFO L225 Difference]: With dead ends: 138 [2024-10-14 09:44:28,118 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 09:44:28,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-10-14 09:44:28,120 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 102 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 09:44:28,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 141 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 09:44:28,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 09:44:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2024-10-14 09:44:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:44:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 97 transitions. [2024-10-14 09:44:28,139 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 97 transitions. Word has length 132 [2024-10-14 09:44:28,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:44:28,140 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 97 transitions. [2024-10-14 09:44:28,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-14 09:44:28,140 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 97 transitions. [2024-10-14 09:44:28,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-14 09:44:28,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:28,142 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:28,160 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:44:28,343 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-10-14 09:44:28,343 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:28,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:28,344 INFO L85 PathProgramCache]: Analyzing trace with hash -2111379149, now seen corresponding path program 1 times [2024-10-14 09:44:28,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:44:28,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058331910] [2024-10-14 09:44:28,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:28,345 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-10-14 09:44:28,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:44:28,347 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-10-14 09:44:28,349 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-10-14 09:44:28,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:28,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:44:28,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:44:30,141 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:44:30,142 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:44:30,142 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:44:30,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058331910] [2024-10-14 09:44:30,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058331910] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:44:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:44:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:44:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83532202] [2024-10-14 09:44:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:44:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:44:30,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:44:30,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:44:30,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:44:30,145 INFO L87 Difference]: Start difference. First operand 68 states and 97 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:30,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:44:30,982 INFO L93 Difference]: Finished difference Result 179 states and 257 transitions. [2024-10-14 09:44:30,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:44:30,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 132 [2024-10-14 09:44:30,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:44:30,988 INFO L225 Difference]: With dead ends: 179 [2024-10-14 09:44:30,989 INFO L226 Difference]: Without dead ends: 112 [2024-10-14 09:44:30,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:44:30,990 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 84 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:44:30,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 295 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 09:44:30,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-14 09:44:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 68. [2024-10-14 09:44:31,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 states have internal predecessors, (55), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-14 09:44:31,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2024-10-14 09:44:31,023 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 132 [2024-10-14 09:44:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:44:31,028 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2024-10-14 09:44:31,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2024-10-14 09:44:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 09:44:31,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:31,030 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:31,046 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 (4)] Ended with exit code 0 [2024-10-14 09:44:31,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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-10-14 09:44:31,231 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:31,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash -716895116, now seen corresponding path program 1 times [2024-10-14 09:44:31,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:44:31,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1072483681] [2024-10-14 09:44:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:31,233 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-10-14 09:44:31,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:44:31,236 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:44:31,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:44:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:31,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 09:44:31,587 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:44:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-14 09:44:34,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:44:34,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:44:34,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1072483681] [2024-10-14 09:44:34,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1072483681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:44:34,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:44:34,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:44:34,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500136628] [2024-10-14 09:44:34,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:44:34,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:44:34,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:44:34,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:44:34,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:44:34,526 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:35,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:44:35,277 INFO L93 Difference]: Finished difference Result 208 states and 289 transitions. [2024-10-14 09:44:35,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:44:35,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 133 [2024-10-14 09:44:35,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:44:35,280 INFO L225 Difference]: With dead ends: 208 [2024-10-14 09:44:35,280 INFO L226 Difference]: Without dead ends: 141 [2024-10-14 09:44:35,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:44:35,282 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 67 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 09:44:35,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 292 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 09:44:35,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-10-14 09:44:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2024-10-14 09:44:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.2159090909090908) internal successors, (107), 88 states have internal predecessors, (107), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-14 09:44:35,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2024-10-14 09:44:35,336 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 133 [2024-10-14 09:44:35,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:44:35,337 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2024-10-14 09:44:35,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-14 09:44:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2024-10-14 09:44:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-14 09:44:35,346 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:44:35,346 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 09:44:35,365 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 (5)] Ended with exit code 0 [2024-10-14 09:44:35,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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-10-14 09:44:35,547 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:44:35,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:44:35,548 INFO L85 PathProgramCache]: Analyzing trace with hash -749262764, now seen corresponding path program 1 times [2024-10-14 09:44:35,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:44:35,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1758084894] [2024-10-14 09:44:35,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:44:35,549 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-10-14 09:44:35,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:44:35,550 INFO L229 MonitoredProcess]: Starting monitored process 6 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-10-14 09:44:35,553 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 (6)] Waiting until timeout for monitored process [2024-10-14 09:44:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:44:35,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 09:44:35,908 INFO L278 TraceCheckSpWp]: Computing forward predicates...