./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-pe-ci_file-70.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-pe-ci_file-70.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:07:47,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:07:47,174 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:07:47,179 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:07:47,180 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:07:47,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:07:47,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:07:47,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:07:47,215 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:07:47,215 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:07:47,215 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:07:47,215 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:07:47,216 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:07:47,216 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:07:47,216 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:07:47,217 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:07:47,220 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:07:47,220 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:07:47,221 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:07:47,221 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:07:47,221 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:07:47,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:07:47,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:07:47,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:07:47,228 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:07:47,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:07:47,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:07:47,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:07:47,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:07:47,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:07:47,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:07:47,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:07:47,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:07:47,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:07:47,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:07:47,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:07:47,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:07:47,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:07:47,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:07:47,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:07:47,233 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:07:47,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:07:47,233 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2024-10-14 09:07:47,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:07:47,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:07:47,512 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:07:47,513 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:07:47,514 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:07:47,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:07:48,936 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:07:49,144 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:07:49,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:07:49,156 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfd509c0/bfa6ab54e6864dcab48c2a833feb19f2/FLAG8b0ea2ba9 [2024-10-14 09:07:49,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddfd509c0/bfa6ab54e6864dcab48c2a833feb19f2 [2024-10-14 09:07:49,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:07:49,522 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:07:49,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:07:49,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:07:49,528 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:07:49,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:49,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c6895aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49, skipping insertion in model container [2024-10-14 09:07:49,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:49,555 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:07:49,706 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-pe-ci_file-70.i[919,932] [2024-10-14 09:07:49,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:07:49,820 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:07:49,857 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-pe-ci_file-70.i[919,932] [2024-10-14 09:07:49,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:07:49,933 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:07:49,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49 WrapperNode [2024-10-14 09:07:49,935 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:07:49,936 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:07:49,936 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:07:49,937 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:07:49,943 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:07:49" (1/1) ... [2024-10-14 09:07:49,959 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:07:49" (1/1) ... [2024-10-14 09:07:50,017 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-10-14 09:07:50,018 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:07:50,018 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:07:50,019 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:07:50,019 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:07:50,029 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,029 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,068 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:07:50,069 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,069 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,091 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,104 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:07:50,105 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:07:50,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:07:50,107 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:07:50,108 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (1/1) ... [2024-10-14 09:07:50,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:07:50,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:07:50,138 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:07:50,141 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:07:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:07:50,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:07:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:07:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:07:50,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:07:50,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:07:50,252 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:07:50,253 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:07:50,603 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:07:50,604 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:07:50,662 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:07:50,663 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:07:50,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:50 BoogieIcfgContainer [2024-10-14 09:07:50,663 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:07:50,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:07:50,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:07:50,669 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:07:50,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:07:49" (1/3) ... [2024-10-14 09:07:50,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e314637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:07:50, skipping insertion in model container [2024-10-14 09:07:50,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:07:49" (2/3) ... [2024-10-14 09:07:50,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e314637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:07:50, skipping insertion in model container [2024-10-14 09:07:50,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:50" (3/3) ... [2024-10-14 09:07:50,674 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:07:50,696 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:07:50,696 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:07:50,756 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:07:50,761 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;@36713cb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:07:50,761 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:07:50,766 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 47 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 09:07:50,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:07:50,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:50,778 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:50,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:50,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1327964579, now seen corresponding path program 1 times [2024-10-14 09:07:50,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:50,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690451173] [2024-10-14 09:07:50,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:50,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:51,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:51,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:51,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:51,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:51,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,235 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 09:07:51,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:51,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690451173] [2024-10-14 09:07:51,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690451173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:51,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:51,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:07:51,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400365266] [2024-10-14 09:07:51,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:51,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:07:51,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:51,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:07:51,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:07:51,272 INFO L87 Difference]: Start difference. First operand has 64 states, 46 states have (on average 1.5869565217391304) internal successors, (73), 47 states have internal predecessors, (73), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 09:07:51,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:51,315 INFO L93 Difference]: Finished difference Result 125 states and 219 transitions. [2024-10-14 09:07:51,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:07:51,329 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-10-14 09:07:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:51,339 INFO L225 Difference]: With dead ends: 125 [2024-10-14 09:07:51,339 INFO L226 Difference]: Without dead ends: 62 [2024-10-14 09:07:51,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 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:07:51,351 INFO L432 NwaCegarLoop]: 94 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, 94 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:07:51,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:07:51,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-14 09:07:51,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-10-14 09:07:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.488888888888889) internal successors, (67), 45 states have internal predecessors, (67), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 09:07:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 97 transitions. [2024-10-14 09:07:51,407 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 97 transitions. Word has length 104 [2024-10-14 09:07:51,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:51,413 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 97 transitions. [2024-10-14 09:07:51,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-14 09:07:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 97 transitions. [2024-10-14 09:07:51,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:07:51,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:51,419 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:07:51,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:51,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:51,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1585591273, now seen corresponding path program 1 times [2024-10-14 09:07:51,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:51,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769800592] [2024-10-14 09:07:51,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:51,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:51,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:51,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:51,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:51,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:51,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:51,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:51,729 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 09:07:51,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:51,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769800592] [2024-10-14 09:07:51,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769800592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:51,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:51,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:07:51,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798234030] [2024-10-14 09:07:51,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:51,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:07:51,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:51,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:07:51,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:07:51,737 INFO L87 Difference]: Start difference. First operand 62 states and 97 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:51,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:51,813 INFO L93 Difference]: Finished difference Result 163 states and 253 transitions. [2024-10-14 09:07:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:07:51,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-14 09:07:51,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:51,816 INFO L225 Difference]: With dead ends: 163 [2024-10-14 09:07:51,816 INFO L226 Difference]: Without dead ends: 102 [2024-10-14 09:07:51,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:07:51,818 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 49 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:51,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 168 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:07:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-14 09:07:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-10-14 09:07:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.5128205128205128) internal successors, (118), 79 states have internal predecessors, (118), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:07:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 154 transitions. [2024-10-14 09:07:51,835 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 154 transitions. Word has length 104 [2024-10-14 09:07:51,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:51,836 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 154 transitions. [2024-10-14 09:07:51,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:51,837 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 154 transitions. [2024-10-14 09:07:51,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:07:51,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:51,839 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:51,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:07:51,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:51,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:51,840 INFO L85 PathProgramCache]: Analyzing trace with hash 715231317, now seen corresponding path program 1 times [2024-10-14 09:07:51,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:51,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681684569] [2024-10-14 09:07:51,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:51,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:52,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:52,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:52,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 09:07:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:52,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681684569] [2024-10-14 09:07:52,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681684569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:52,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:52,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:07:52,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541756358] [2024-10-14 09:07:52,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:52,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:07:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:07:52,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:07:52,855 INFO L87 Difference]: Start difference. First operand 99 states and 154 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:53,274 INFO L93 Difference]: Finished difference Result 415 states and 636 transitions. [2024-10-14 09:07:53,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:07:53,277 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-14 09:07:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:53,285 INFO L225 Difference]: With dead ends: 415 [2024-10-14 09:07:53,285 INFO L226 Difference]: Without dead ends: 317 [2024-10-14 09:07:53,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:07:53,289 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 199 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:53,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 271 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 09:07:53,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-14 09:07:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 262. [2024-10-14 09:07:53,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 211 states have (on average 1.5165876777251184) internal successors, (320), 215 states have internal predecessors, (320), 44 states have call successors, (44), 6 states have call predecessors, (44), 6 states have return successors, (44), 40 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 09:07:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 408 transitions. [2024-10-14 09:07:53,347 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 408 transitions. Word has length 104 [2024-10-14 09:07:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:53,348 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 408 transitions. [2024-10-14 09:07:53,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 408 transitions. [2024-10-14 09:07:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:07:53,354 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:53,355 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:53,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:07:53,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:53,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:53,356 INFO L85 PathProgramCache]: Analyzing trace with hash 322204307, now seen corresponding path program 1 times [2024-10-14 09:07:53,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:53,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555983240] [2024-10-14 09:07:53,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:53,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:53,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:53,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:53,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:53,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:53,771 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 09:07:53,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:53,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555983240] [2024-10-14 09:07:53,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555983240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:07:53,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:07:53,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:07:53,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137325800] [2024-10-14 09:07:53,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:07:53,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:07:53,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:53,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:07:53,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:07:53,776 INFO L87 Difference]: Start difference. First operand 262 states and 408 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:53,945 INFO L93 Difference]: Finished difference Result 770 states and 1164 transitions. [2024-10-14 09:07:53,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:07:53,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-14 09:07:53,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:53,951 INFO L225 Difference]: With dead ends: 770 [2024-10-14 09:07:53,951 INFO L226 Difference]: Without dead ends: 509 [2024-10-14 09:07:53,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:07:53,957 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 169 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:53,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 385 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:07:53,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-10-14 09:07:54,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 419. [2024-10-14 09:07:54,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 336 states have (on average 1.4702380952380953) internal successors, (494), 338 states have internal predecessors, (494), 70 states have call successors, (70), 12 states have call predecessors, (70), 12 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:07:54,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2024-10-14 09:07:54,015 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 104 [2024-10-14 09:07:54,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:54,016 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2024-10-14 09:07:54,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:07:54,016 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2024-10-14 09:07:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:07:54,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:54,018 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:54,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:07:54,019 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:54,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:54,019 INFO L85 PathProgramCache]: Analyzing trace with hash 580369745, now seen corresponding path program 1 times [2024-10-14 09:07:54,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:54,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211016090] [2024-10-14 09:07:54,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:54,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:54,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:54,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,372 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 09:07:54,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:54,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211016090] [2024-10-14 09:07:54,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211016090] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:07:54,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227438080] [2024-10-14 09:07:54,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:54,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:07:54,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:07:54,376 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:07:54,378 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:07:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:54,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:07:54,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:07:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-14 09:07:54,683 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:07:54,864 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 09:07:54,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227438080] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:07:54,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:07:54,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-14 09:07:54,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056546775] [2024-10-14 09:07:54,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:07:54,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:07:54,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:07:54,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:07:54,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:07:54,867 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 09:07:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:07:55,055 INFO L93 Difference]: Finished difference Result 761 states and 1117 transitions. [2024-10-14 09:07:55,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:07:55,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 104 [2024-10-14 09:07:55,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:07:55,059 INFO L225 Difference]: With dead ends: 761 [2024-10-14 09:07:55,061 INFO L226 Difference]: Without dead ends: 343 [2024-10-14 09:07:55,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:07:55,063 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 58 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:07:55,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 171 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:07:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-14 09:07:55,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2024-10-14 09:07:55,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 246 states have (on average 1.3495934959349594) internal successors, (332), 248 states have internal predecessors, (332), 70 states have call successors, (70), 18 states have call predecessors, (70), 18 states have return successors, (70), 68 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:07:55,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 472 transitions. [2024-10-14 09:07:55,115 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 472 transitions. Word has length 104 [2024-10-14 09:07:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:07:55,116 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 472 transitions. [2024-10-14 09:07:55,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 09:07:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 472 transitions. [2024-10-14 09:07:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 09:07:55,118 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:07:55,119 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:55,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 09:07:55,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:07:55,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:07:55,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:07:55,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1222495023, now seen corresponding path program 1 times [2024-10-14 09:07:55,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:07:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348494223] [2024-10-14 09:07:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:07:55,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:07:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 09:07:56,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 09:07:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 09:07:56,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-14 09:07:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-14 09:07:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-14 09:07:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-14 09:07:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-14 09:07:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 09:07:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-14 09:07:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-14 09:07:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 09:07:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-14 09:07:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 09:07:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 33 proven. 9 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 09:07:56,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:07:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348494223] [2024-10-14 09:07:56,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348494223] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:07:56,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109269386] [2024-10-14 09:07:56,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:07:56,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:07:56,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:07:56,643 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:07:56,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:07:57,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:07:57,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 09:07:57,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:07:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 292 proven. 30 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2024-10-14 09:07:58,219 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:00,488 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 78 proven. 39 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-10-14 09:08:00,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109269386] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:08:00,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:08:00,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 17] total 37 [2024-10-14 09:08:00,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995733196] [2024-10-14 09:08:00,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:08:00,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-10-14 09:08:00,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:08:00,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-10-14 09:08:00,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1067, Unknown=0, NotChecked=0, Total=1332 [2024-10-14 09:08:00,492 INFO L87 Difference]: Start difference. First operand 335 states and 472 transitions. Second operand has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-10-14 09:08:09,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:09,856 INFO L93 Difference]: Finished difference Result 1230 states and 1633 transitions. [2024-10-14 09:08:09,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-14 09:08:09,857 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) Word has length 105 [2024-10-14 09:08:09,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:09,862 INFO L225 Difference]: With dead ends: 1230 [2024-10-14 09:08:09,862 INFO L226 Difference]: Without dead ends: 896 [2024-10-14 09:08:09,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4651 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2774, Invalid=10798, Unknown=0, NotChecked=0, Total=13572 [2024-10-14 09:08:09,868 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1603 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 2197 mSolverCounterSat, 666 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1618 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 2863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 666 IncrementalHoareTripleChecker+Valid, 2197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:09,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1618 Valid, 1364 Invalid, 2863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [666 Valid, 2197 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 09:08:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2024-10-14 09:08:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 530. [2024-10-14 09:08:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 378 states have (on average 1.253968253968254) internal successors, (474), 382 states have internal predecessors, (474), 109 states have call successors, (109), 42 states have call predecessors, (109), 42 states have return successors, (109), 105 states have call predecessors, (109), 109 states have call successors, (109) [2024-10-14 09:08:09,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 692 transitions. [2024-10-14 09:08:09,999 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 692 transitions. Word has length 105 [2024-10-14 09:08:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:10,000 INFO L471 AbstractCegarLoop]: Abstraction has 530 states and 692 transitions. [2024-10-14 09:08:10,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.7777777777777777) internal successors, (100), 35 states have internal predecessors, (100), 10 states have call successors, (45), 5 states have call predecessors, (45), 11 states have return successors, (45), 10 states have call predecessors, (45), 10 states have call successors, (45) [2024-10-14 09:08:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 692 transitions. [2024-10-14 09:08:10,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 09:08:10,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:10,003 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:10,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 09:08:10,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 09:08:10,208 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1792608595, now seen corresponding path program 1 times [2024-10-14 09:08:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:08:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483539673] [2024-10-14 09:08:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:10,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:08:10,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:08:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006678027] [2024-10-14 09:08:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:10,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:10,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:10,370 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:08:10,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 09:08:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:08:11,117 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:08:11,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:08:11,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:08:11,356 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:08:11,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:08:11,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 09:08:11,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:08:11,562 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:08:11,664 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:08:11,668 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:08:11 BoogieIcfgContainer [2024-10-14 09:08:11,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:08:11,669 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:08:11,669 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:08:11,670 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:08:11,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:07:50" (3/4) ... [2024-10-14 09:08:11,673 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:08:11,674 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:08:11,675 INFO L158 Benchmark]: Toolchain (without parser) took 22152.03ms. Allocated memory was 172.0MB in the beginning and 413.1MB in the end (delta: 241.2MB). Free memory was 105.2MB in the beginning and 363.5MB in the end (delta: -258.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:08:11,676 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:08:11,677 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.58ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 140.6MB in the end (delta: -35.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. [2024-10-14 09:08:11,677 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.95ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 135.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:08:11,677 INFO L158 Benchmark]: Boogie Preprocessor took 86.36ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 130.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:08:11,677 INFO L158 Benchmark]: RCFGBuilder took 557.92ms. Allocated memory is still 172.0MB. Free memory was 130.1MB in the beginning and 99.3MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 09:08:11,678 INFO L158 Benchmark]: TraceAbstraction took 21002.57ms. Allocated memory was 172.0MB in the beginning and 413.1MB in the end (delta: 241.2MB). Free memory was 98.6MB in the beginning and 363.5MB in the end (delta: -264.9MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. [2024-10-14 09:08:11,678 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 413.1MB. Free memory is still 363.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:08:11,679 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 104.9MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.58ms. Allocated memory is still 172.0MB. Free memory was 105.0MB in the beginning and 140.6MB in the end (delta: -35.6MB). Peak memory consumption was 13.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.95ms. Allocated memory is still 172.0MB. Free memory was 140.6MB in the beginning and 135.7MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.36ms. Allocated memory is still 172.0MB. Free memory was 135.7MB in the beginning and 130.1MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 557.92ms. Allocated memory is still 172.0MB. Free memory was 130.1MB in the beginning and 99.3MB in the end (delta: 30.8MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21002.57ms. Allocated memory was 172.0MB in the beginning and 413.1MB in the end (delta: 241.2MB). Free memory was 98.6MB in the beginning and 363.5MB in the end (delta: -264.9MB). Peak memory consumption was 209.7MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 413.1MB. Free memory is still 363.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 157. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.05; [L23] double var_1_6 = 0.0; [L24] double var_1_7 = 49.5; [L25] double var_1_8 = 16.75; [L26] unsigned short int var_1_9 = 1; [L27] unsigned long int var_1_11 = 8; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 1; [L30] unsigned char var_1_14 = 32; [L31] unsigned char var_1_15 = 50; [L32] unsigned char var_1_16 = 8; [L33] unsigned char var_1_17 = 32; [L34] unsigned long int var_1_18 = 2; [L35] unsigned long int var_1_19 = 3876014737; [L36] unsigned char var_1_20 = 0; [L37] unsigned short int var_1_21 = 25; [L38] unsigned char var_1_27 = 1; [L39] unsigned char var_1_31 = 1; [L40] unsigned long int var_1_33 = 2; [L41] unsigned short int var_1_34 = 0; [L42] signed short int var_1_35 = -10; [L43] unsigned char var_1_40 = 2; [L44] unsigned short int var_1_42 = 8; [L45] unsigned long int var_1_44 = 1249494912; [L46] double last_1_var_1_1 = 5.05; [L47] unsigned short int last_1_var_1_9 = 1; [L48] unsigned long int last_1_var_1_11 = 8; [L49] unsigned char last_1_var_1_14 = 32; [L50] unsigned char last_1_var_1_20 = 0; [L161] isInitial = 1 [L162] FCALL initially() [L163] COND TRUE 1 [L164] CALL updateLastVariables() [L150] last_1_var_1_1 = var_1_1 [L151] last_1_var_1_9 = var_1_9 [L152] last_1_var_1_11 = var_1_11 [L153] last_1_var_1_14 = var_1_14 [L154] last_1_var_1_20 = var_1_20 [L164] RET updateLastVariables() [L165] CALL updateVariables() [L124] var_1_6 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L125] RET assume_abort_if_not((var_1_6 >= 2305843.009213691390e+12F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_7=99/2, var_1_8=67/4, var_1_9=1] [L126] var_1_7 = __VERIFIER_nondet_double() [L127] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L127] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 2305843.009213691390e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_8=67/4, var_1_9=1] [L128] var_1_8 = __VERIFIER_nondet_double() [L129] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L129] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L130] var_1_13 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_13 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L131] RET assume_abort_if_not(var_1_13 >= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L132] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=50, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L133] var_1_15 = __VERIFIER_nondet_uchar() [L134] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L134] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_15 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L135] RET assume_abort_if_not(var_1_15 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=8, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L136] var_1_16 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L137] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L138] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=32, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L139] var_1_17 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L140] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_17 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L141] RET assume_abort_if_not(var_1_17 <= 254) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=3876014737, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L142] var_1_19 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_19 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L143] RET assume_abort_if_not(var_1_19 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L144] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1249494912, var_1_9=1] [L145] var_1_44 = __VERIFIER_nondet_ulong() [L146] CALL assume_abort_if_not(var_1_44 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L146] RET assume_abort_if_not(var_1_44 >= 1073741823) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_44 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L147] RET assume_abort_if_not(var_1_44 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=2, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L165] RET updateVariables() [L166] CALL step() [L54] COND TRUE \read(var_1_13) [L55] var_1_18 = ((var_1_19 - last_1_var_1_9) - last_1_var_1_11) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L59] COND FALSE !(var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=32, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L68] COND TRUE (8 - 64) <= (var_1_9 - var_1_9) [L69] var_1_14 = (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L73] signed long int stepLocal_0 = - ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))); VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, stepLocal_0=-1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=101/20, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_9=1] [L74] COND FALSE !(var_1_18 >= stepLocal_0) [L77] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=0, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L79] COND TRUE (var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14))) [L80] var_1_20 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=0, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L82] COND TRUE \read(var_1_20) [L83] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=8, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L85] var_1_11 = (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u)) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L86] COND FALSE !(((((var_1_9) < (var_1_14)) ? (var_1_9) : (var_1_14))) > var_1_18) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L89] COND FALSE !((var_1_15 <= var_1_9) && var_1_20) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L100] COND TRUE var_1_17 > (- var_1_17) [L101] var_1_31 = (var_1_13 && var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=0, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L103] var_1_33 = var_1_15 [L104] var_1_34 = (var_1_14 + 4) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=-10, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L105] COND TRUE ((var_1_7 - var_1_6) + var_1_6) == var_1_8 [L106] var_1_35 = var_1_14 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=2, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L108] COND TRUE var_1_18 >= (~ var_1_19) [L109] var_1_40 = var_1_16 VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L111] COND TRUE \read(var_1_13) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L112] COND FALSE !(var_1_19 < 1) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L166] RET step() [L167] CALL, EXPR property() [L157-L158] return (((((((var_1_18 >= (- ((((var_1_9) < (var_1_9)) ? (var_1_9) : (var_1_9))))) ? (var_1_1 == ((double) (((var_1_6 - var_1_7) - ((((64.75) > (128.725)) ? (64.75) : (128.725)))) + var_1_8))) : (var_1_1 == ((double) var_1_7))) && ((var_1_6 > ((((var_1_8) < (last_1_var_1_1)) ? (var_1_8) : (last_1_var_1_1)))) ? ((! ((last_1_var_1_1 == var_1_7) && (last_1_var_1_20 || last_1_var_1_20))) ? ((! (var_1_6 <= var_1_7)) ? (var_1_9 == ((unsigned short int) ((((last_1_var_1_14) < (last_1_var_1_14)) ? (last_1_var_1_14) : (last_1_var_1_14))))) : 1) : (var_1_9 == ((unsigned short int) last_1_var_1_14))) : 1)) && (var_1_11 == ((unsigned long int) (var_1_9 + (((((var_1_18) < (var_1_9)) ? (var_1_18) : (var_1_9))) + 2u))))) && (var_1_20 ? (var_1_12 == ((unsigned char) var_1_13)) : 1)) && (((8 - 64) <= (var_1_9 - var_1_9)) ? (var_1_14 == ((unsigned char) (((((var_1_15 + var_1_16)) < (var_1_17)) ? ((var_1_15 + var_1_16)) : (var_1_17))))) : (var_1_14 == ((unsigned char) var_1_17)))) && (var_1_13 ? (var_1_18 == ((unsigned long int) ((var_1_19 - last_1_var_1_9) - last_1_var_1_11))) : (var_1_18 == ((unsigned long int) (((((var_1_19 - var_1_17)) > (var_1_15)) ? ((var_1_19 - var_1_17)) : (var_1_15))))))) && (((var_1_14 / var_1_19) <= ((((var_1_18) < (var_1_14)) ? (var_1_18) : (var_1_14)))) ? (var_1_20 == ((unsigned char) var_1_13)) : 1) ; [L167] RET, EXPR property() [L167] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=8, last_1_var_1_14=32, last_1_var_1_1=101/20, last_1_var_1_20=0, last_1_var_1_9=1, var_1_11=4, var_1_12=1, var_1_13=1, var_1_14=2, var_1_15=2, var_1_16=0, var_1_17=254, var_1_18=-5368709128, var_1_19=-5368709119, var_1_1=2, var_1_20=1, var_1_21=25, var_1_27=1, var_1_31=1, var_1_33=2, var_1_34=6, var_1_35=2, var_1_40=0, var_1_42=8, var_1_44=1073741823, var_1_7=2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.8s, OverallIterations: 7, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2096 SdHoareTripleChecker+Valid, 3.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2078 mSDsluCounter, 2453 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1869 mSDsCounter, 695 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2585 IncrementalHoareTripleChecker+Invalid, 3280 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 695 mSolverCounterUnsat, 584 mSDtfsCounter, 2585 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 748 GetRequests, 615 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4652 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=6, InterpolantAutomatonStates: 113, 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, 6 MinimizatonAttempts, 522 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1044 NumberOfCodeBlocks, 1044 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 6697 SizeOfPredicates, 10 NumberOfNonLiveVariables, 554 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 4023/4200 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:08:11,784 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-pe-ci_file-70.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 c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:08:13,986 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:08:14,074 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:08:14,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:08:14,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:08:14,117 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:08:14,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:08:14,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:08:14,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:08:14,121 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:08:14,121 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:08:14,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:08:14,122 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:08:14,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:08:14,123 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:08:14,124 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:08:14,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:08:14,125 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:08:14,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:08:14,126 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:08:14,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:08:14,127 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:08:14,127 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:08:14,127 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:08:14,128 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:08:14,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:08:14,128 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:08:14,129 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:08:14,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:08:14,129 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:08:14,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:08:14,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:08:14,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:08:14,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:08:14,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:08:14,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:08:14,132 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:08:14,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:08:14,132 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:08:14,133 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:08:14,133 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:08:14,133 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:08:14,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:08:14,134 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:08:14,134 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:08:14,134 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 -> c629da573e004159921914643ea74746a2df9f21fcd6971058637a927e2b9e2c [2024-10-14 09:08:14,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:08:14,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:08:14,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:08:14,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:08:14,486 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:08:14,487 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:08:16,055 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:08:16,262 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:08:16,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:08:16,284 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0ae0740/1084984db20a43678c6ca18d0a4143e1/FLAG9d4abc7dd [2024-10-14 09:08:16,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe0ae0740/1084984db20a43678c6ca18d0a4143e1 [2024-10-14 09:08:16,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:08:16,619 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:08:16,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:08:16,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:08:16,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:08:16,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:08:16" (1/1) ... [2024-10-14 09:08:16,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e15174 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:16, skipping insertion in model container [2024-10-14 09:08:16,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:08:16" (1/1) ... [2024-10-14 09:08:16,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:08:16,836 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-pe-ci_file-70.i[919,932] [2024-10-14 09:08:16,920 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:08:16,937 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:08:16,950 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-pe-ci_file-70.i[919,932] [2024-10-14 09:08:16,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:08:17,026 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:08:17,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17 WrapperNode [2024-10-14 09:08:17,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:08:17,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:08:17,028 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:08:17,028 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:08:17,034 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:08:17" (1/1) ... [2024-10-14 09:08:17,053 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:08:17" (1/1) ... [2024-10-14 09:08:17,091 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 152 [2024-10-14 09:08:17,091 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:08:17,093 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:08:17,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:08:17,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:08:17,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,128 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:08:17,132 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,132 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,144 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,149 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,151 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,154 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:08:17,155 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:08:17,155 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:08:17,155 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:08:17,157 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (1/1) ... [2024-10-14 09:08:17,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:08:17,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:08:17,199 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:08:17,202 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:08:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:08:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:08:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:08:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:08:17,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:08:17,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:08:17,329 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:08:17,331 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:08:21,495 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-14 09:08:21,496 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:08:21,554 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:08:21,554 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:08:21,555 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:08:21 BoogieIcfgContainer [2024-10-14 09:08:21,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:08:21,557 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:08:21,557 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:08:21,560 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:08:21,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:08:16" (1/3) ... [2024-10-14 09:08:21,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22149842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:08:21, skipping insertion in model container [2024-10-14 09:08:21,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:08:17" (2/3) ... [2024-10-14 09:08:21,561 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22149842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:08:21, skipping insertion in model container [2024-10-14 09:08:21,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:08:21" (3/3) ... [2024-10-14 09:08:21,562 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-70.i [2024-10-14 09:08:21,584 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:08:21,584 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:08:21,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:08:21,652 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;@2e58fc67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:08:21,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:08:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 40 states have (on average 1.575) internal successors, (63), 41 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 09:08:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:08:21,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:21,667 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,668 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:21,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:21,674 INFO L85 PathProgramCache]: Analyzing trace with hash -2009444281, now seen corresponding path program 1 times [2024-10-14 09:08:21,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:21,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [880784480] [2024-10-14 09:08:21,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:21,689 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:08:21,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:21,693 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:08:21,695 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:08:22,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:22,169 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 09:08:22,184 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-14 09:08:24,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:25,156 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:25,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [880784480] [2024-10-14 09:08:25,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [880784480] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:08:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1667207274] [2024-10-14 09:08:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:08:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:08:25,174 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:08:25,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-10-14 09:08:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:25,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 09:08:25,290 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-14 09:08:25,428 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:08:25,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc5 [1667207274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:08:25,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 09:08:25,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2024-10-14 09:08:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026279536] [2024-10-14 09:08:25,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:08:25,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:08:25,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:08:25,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:08:25,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:08:25,455 INFO L87 Difference]: Start difference. First operand has 58 states, 40 states have (on average 1.575) internal successors, (63), 41 states have internal predecessors, (63), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:08:28,616 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.83s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:08:28,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:28,742 INFO L93 Difference]: Finished difference Result 147 states and 257 transitions. [2024-10-14 09:08:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:08:28,745 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 104 [2024-10-14 09:08:28,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:28,752 INFO L225 Difference]: With dead ends: 147 [2024-10-14 09:08:28,752 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 09:08:28,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-10-14 09:08:28,758 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:28,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 148 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-10-14 09:08:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 09:08:28,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2024-10-14 09:08:28,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.4545454545454546) internal successors, (96), 67 states have internal predecessors, (96), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-14 09:08:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-10-14 09:08:28,799 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 104 [2024-10-14 09:08:28,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:28,801 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-10-14 09:08:28,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-14 09:08:28,801 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-10-14 09:08:28,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-14 09:08:28,805 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:28,805 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,825 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:08:29,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:08:29,210 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,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-10-14 09:08:29,210 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:29,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:29,211 INFO L85 PathProgramCache]: Analyzing trace with hash 291378309, now seen corresponding path program 1 times [2024-10-14 09:08:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246453564] [2024-10-14 09:08:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:29,212 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:08:29,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:29,216 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:08:29,217 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:08:29,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:29,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:08:29,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:30,078 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 152 proven. 33 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-10-14 09:08:30,079 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 9 proven. 33 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-10-14 09:08:30,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:30,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246453564] [2024-10-14 09:08:30,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246453564] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:08:30,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:08:30,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 09:08:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586600512] [2024-10-14 09:08:30,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:08:30,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:08:30,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:08:30,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:08:30,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:08:30,477 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 09:08:33,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:08:33,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:08:33,947 INFO L93 Difference]: Finished difference Result 152 states and 224 transitions. [2024-10-14 09:08:33,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:08:33,984 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 104 [2024-10-14 09:08:33,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:08:33,986 INFO L225 Difference]: With dead ends: 152 [2024-10-14 09:08:33,986 INFO L226 Difference]: Without dead ends: 66 [2024-10-14 09:08:33,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:08:33,988 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 47 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:08:33,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 142 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-10-14 09:08:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-10-14 09:08:33,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2024-10-14 09:08:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3333333333333333) internal successors, (60), 45 states have internal predecessors, (60), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-14 09:08:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-10-14 09:08:33,999 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 104 [2024-10-14 09:08:34,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:08:34,000 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-10-14 09:08:34,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 7 states have internal predecessors, (41), 2 states have call successors, (26), 2 states have call predecessors, (26), 4 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2024-10-14 09:08:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-10-14 09:08:34,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-14 09:08:34,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:08:34,003 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,020 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:08:34,204 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:08:34,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:08:34,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:08:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 2116866311, now seen corresponding path program 1 times [2024-10-14 09:08:34,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:08:34,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [338235575] [2024-10-14 09:08:34,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:34,207 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:08:34,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:08:34,208 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:08:34,209 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:08:34,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:34,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 09:08:34,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:08:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 168 proven. 9 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-14 09:08:36,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:08:43,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:08:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [338235575] [2024-10-14 09:08:43,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [338235575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:08:43,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [916052355] [2024-10-14 09:08:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:08:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 09:08:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 09:08:43,222 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 09:08:43,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-14 09:08:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:08:43,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-10-14 09:08:43,333 INFO L278 TraceCheckSpWp]: Computing forward predicates...