./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:11:52,270 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:11:52,342 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-18 20:11:52,347 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:11:52,348 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:11:52,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:11:52,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:11:52,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:11:52,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:11:52,376 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:11:52,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:11:52,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:11:52,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:11:52,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:11:52,378 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:11:52,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:11:52,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:11:52,380 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:11:52,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 20:11:52,382 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:11:52,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:11:52,383 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:11:52,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:11:52,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:11:52,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:11:52,385 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:11:52,385 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:11:52,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:11:52,385 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:11:52,385 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:11:52,386 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 20:11:52,386 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 20:11:52,387 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:11:52,387 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:11:52,387 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:11:52,387 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:11:52,387 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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2024-11-18 20:11:52,636 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:11:52,656 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:11:52,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:11:52,661 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:11:52,661 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:11:52,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:11:53,882 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:11:54,040 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:11:54,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:11:54,048 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78f69060/8826b627cb6d4733930578ae79c6d3a5/FLAG14a62d288 [2024-11-18 20:11:54,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f78f69060/8826b627cb6d4733930578ae79c6d3a5 [2024-11-18 20:11:54,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:11:54,063 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:11:54,064 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:11:54,064 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:11:54,070 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:11:54,070 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,071 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29d32c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54, skipping insertion in model container [2024-11-18 20:11:54,071 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:11:54,238 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-18 20:11:54,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:11:54,307 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:11:54,316 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-18 20:11:54,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:11:54,366 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:11:54,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54 WrapperNode [2024-11-18 20:11:54,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:11:54,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:11:54,371 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:11:54,371 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:11:54,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,418 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-18 20:11:54,418 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:11:54,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:11:54,419 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:11:54,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:11:54,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,431 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:11:54,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,492 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,500 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,504 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:11:54,505 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:11:54,505 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:11:54,505 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:11:54,507 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (1/1) ... [2024-11-18 20:11:54,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:11:54,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:11:54,536 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:11:54,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:11:54,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:11:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:11:54,575 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:11:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 20:11:54,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:11:54,575 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:11:54,642 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:11:54,644 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:11:54,939 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 20:11:54,939 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:11:54,954 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:11:54,955 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:11:54,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:11:54 BoogieIcfgContainer [2024-11-18 20:11:54,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:11:54,958 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:11:54,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:11:54,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:11:54,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:11:54" (1/3) ... [2024-11-18 20:11:54,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe9acaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:11:54, skipping insertion in model container [2024-11-18 20:11:54,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:11:54" (2/3) ... [2024-11-18 20:11:54,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe9acaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:11:54, skipping insertion in model container [2024-11-18 20:11:54,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:11:54" (3/3) ... [2024-11-18 20:11:54,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:11:54,983 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:11:54,984 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:11:55,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:11:55,047 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;@7327ab48, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:11:55,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:11:55,051 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:11:55,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:11:55,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:55,062 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:55,063 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:55,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:55,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1826340194, now seen corresponding path program 1 times [2024-11-18 20:11:55,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:55,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517504700] [2024-11-18 20:11:55,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:55,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:11:55,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:55,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517504700] [2024-11-18 20:11:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517504700] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:11:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889143356] [2024-11-18 20:11:55,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:55,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:11:55,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:11:55,375 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:11:55,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-18 20:11:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:55,519 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:11:55,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:11:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 578 trivial. 0 not checked. [2024-11-18 20:11:55,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:11:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889143356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:11:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-18 20:11:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462857117] [2024-11-18 20:11:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:11:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:55,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:11:55,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:11:55,596 INFO L87 Difference]: Start difference. First operand has 74 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:11:55,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:55,625 INFO L93 Difference]: Finished difference Result 139 states and 237 transitions. [2024-11-18 20:11:55,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:11:55,627 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2024-11-18 20:11:55,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:55,652 INFO L225 Difference]: With dead ends: 139 [2024-11-18 20:11:55,652 INFO L226 Difference]: Without dead ends: 68 [2024-11-18 20:11:55,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:11:55,660 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:55,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:11:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-18 20:11:55,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-18 20:11:55,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.375) internal successors, (66), 48 states have internal predecessors, (66), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:11:55,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2024-11-18 20:11:55,724 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 129 [2024-11-18 20:11:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:55,725 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2024-11-18 20:11:55,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:11:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2024-11-18 20:11:55,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:55,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:55,730 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:55,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-18 20:11:55,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-18 20:11:55,935 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:55,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:55,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1387010548, now seen corresponding path program 1 times [2024-11-18 20:11:55,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:55,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120119484] [2024-11-18 20:11:55,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:55,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:11:56,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:56,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120119484] [2024-11-18 20:11:56,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120119484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:56,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:11:56,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:11:56,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427059784] [2024-11-18 20:11:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:56,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:11:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:56,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:11:56,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:11:56,215 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:56,372 INFO L93 Difference]: Finished difference Result 172 states and 257 transitions. [2024-11-18 20:11:56,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:11:56,373 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:11:56,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:56,376 INFO L225 Difference]: With dead ends: 172 [2024-11-18 20:11:56,377 INFO L226 Difference]: Without dead ends: 107 [2024-11-18 20:11:56,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:11:56,378 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 51 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:56,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 228 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:11:56,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-18 20:11:56,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-18 20:11:56,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 71 states have (on average 1.3380281690140845) internal successors, (95), 72 states have internal predecessors, (95), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 20:11:56,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2024-11-18 20:11:56,394 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 130 [2024-11-18 20:11:56,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:56,395 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2024-11-18 20:11:56,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,395 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2024-11-18 20:11:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:56,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:56,397 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:56,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 20:11:56,397 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:56,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:56,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1329752246, now seen corresponding path program 1 times [2024-11-18 20:11:56,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:56,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108217666] [2024-11-18 20:11:56,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:56,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:11:56,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:56,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108217666] [2024-11-18 20:11:56,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108217666] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:56,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:11:56,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:11:56,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742197099] [2024-11-18 20:11:56,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:56,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:11:56,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:56,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:11:56,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:11:56,641 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:56,762 INFO L93 Difference]: Finished difference Result 278 states and 413 transitions. [2024-11-18 20:11:56,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:11:56,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:11:56,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:56,768 INFO L225 Difference]: With dead ends: 278 [2024-11-18 20:11:56,768 INFO L226 Difference]: Without dead ends: 177 [2024-11-18 20:11:56,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:11:56,770 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 53 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:56,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 236 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:11:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-18 20:11:56,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 173. [2024-11-18 20:11:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 123 states have internal predecessors, (160), 48 states have call successors, (48), 4 states have call predecessors, (48), 4 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-18 20:11:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 256 transitions. [2024-11-18 20:11:56,800 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 256 transitions. Word has length 130 [2024-11-18 20:11:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:56,801 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 256 transitions. [2024-11-18 20:11:56,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,801 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 256 transitions. [2024-11-18 20:11:56,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:56,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:56,803 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:56,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 20:11:56,803 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:56,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:56,804 INFO L85 PathProgramCache]: Analyzing trace with hash -628687668, now seen corresponding path program 1 times [2024-11-18 20:11:56,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:56,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420018647] [2024-11-18 20:11:56,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:56,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:56,925 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:11:56,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:56,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420018647] [2024-11-18 20:11:56,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420018647] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:56,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:11:56,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:11:56,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176731327] [2024-11-18 20:11:56,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:56,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:11:56,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:56,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:11:56,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:11:56,929 INFO L87 Difference]: Start difference. First operand 173 states and 256 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:56,946 INFO L93 Difference]: Finished difference Result 292 states and 434 transitions. [2024-11-18 20:11:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:11:56,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:11:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:56,951 INFO L225 Difference]: With dead ends: 292 [2024-11-18 20:11:56,952 INFO L226 Difference]: Without dead ends: 122 [2024-11-18 20:11:56,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11-18 20:11:56,957 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:56,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 196 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:11:56,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-18 20:11:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-11-18 20:11:56,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 79 states have (on average 1.2911392405063291) internal successors, (102), 81 states have internal predecessors, (102), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-18 20:11:56,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2024-11-18 20:11:56,974 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 130 [2024-11-18 20:11:56,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:56,974 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2024-11-18 20:11:56,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:56,974 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2024-11-18 20:11:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:56,976 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:56,976 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:56,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 20:11:56,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:56,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:56,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1276271308, now seen corresponding path program 1 times [2024-11-18 20:11:56,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:56,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250499859] [2024-11-18 20:11:56,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:56,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:57,718 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:11:57,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:57,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250499859] [2024-11-18 20:11:57,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250499859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:57,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:11:57,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-18 20:11:57,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359312895] [2024-11-18 20:11:57,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:57,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-18 20:11:57,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:57,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-18 20:11:57,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-18 20:11:57,721 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:11:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:58,608 INFO L93 Difference]: Finished difference Result 453 states and 657 transitions. [2024-11-18 20:11:58,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:11:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-18 20:11:58,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:58,612 INFO L225 Difference]: With dead ends: 453 [2024-11-18 20:11:58,612 INFO L226 Difference]: Without dead ends: 352 [2024-11-18 20:11:58,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2024-11-18 20:11:58,614 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 607 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:58,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 348 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-18 20:11:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-18 20:11:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 172. [2024-11-18 20:11:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 129 states have internal predecessors, (174), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-18 20:11:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 252 transitions. [2024-11-18 20:11:58,655 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 252 transitions. Word has length 130 [2024-11-18 20:11:58,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:58,655 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 252 transitions. [2024-11-18 20:11:58,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:11:58,655 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 252 transitions. [2024-11-18 20:11:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:58,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:58,657 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:58,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 20:11:58,657 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:58,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:58,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1956329678, now seen corresponding path program 1 times [2024-11-18 20:11:58,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:58,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935567193] [2024-11-18 20:11:58,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:58,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:58,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:59,001 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:11:59,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:59,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935567193] [2024-11-18 20:11:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935567193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:11:59,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:11:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:11:59,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165937177] [2024-11-18 20:11:59,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:11:59,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:11:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:59,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:11:59,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:11:59,004 INFO L87 Difference]: Start difference. First operand 172 states and 252 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:11:59,326 INFO L93 Difference]: Finished difference Result 451 states and 654 transitions. [2024-11-18 20:11:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:11:59,327 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:11:59,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:11:59,331 INFO L225 Difference]: With dead ends: 451 [2024-11-18 20:11:59,332 INFO L226 Difference]: Without dead ends: 282 [2024-11-18 20:11:59,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 20:11:59,333 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 162 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 20:11:59,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 298 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 20:11:59,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-18 20:11:59,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 158. [2024-11-18 20:11:59,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.3274336283185841) internal successors, (150), 115 states have internal predecessors, (150), 39 states have call successors, (39), 5 states have call predecessors, (39), 5 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-18 20:11:59,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 228 transitions. [2024-11-18 20:11:59,383 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 228 transitions. Word has length 130 [2024-11-18 20:11:59,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:11:59,385 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 228 transitions. [2024-11-18 20:11:59,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:11:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 228 transitions. [2024-11-18 20:11:59,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:11:59,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:11:59,386 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:11:59,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 20:11:59,387 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:11:59,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:11:59,387 INFO L85 PathProgramCache]: Analyzing trace with hash 255202954, now seen corresponding path program 1 times [2024-11-18 20:11:59,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:11:59,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383155338] [2024-11-18 20:11:59,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:59,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:11:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:59,577 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:11:59,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:11:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383155338] [2024-11-18 20:11:59,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383155338] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-18 20:11:59,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [408029787] [2024-11-18 20:11:59,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:11:59,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:11:59,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:11:59,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:11:59,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-18 20:11:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:11:59,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-18 20:11:59,679 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:11:59,810 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 20:11:59,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:11:59,970 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:11:59,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [408029787] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:11:59,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-18 20:11:59,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-18 20:11:59,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726392758] [2024-11-18 20:11:59,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-18 20:11:59,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-18 20:11:59,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:11:59,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-18 20:11:59,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:11:59,973 INFO L87 Difference]: Start difference. First operand 158 states and 228 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 20:12:00,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:00,137 INFO L93 Difference]: Finished difference Result 290 states and 403 transitions. [2024-11-18 20:12:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-18 20:12:00,138 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 130 [2024-11-18 20:12:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:00,139 INFO L225 Difference]: With dead ends: 290 [2024-11-18 20:12:00,139 INFO L226 Difference]: Without dead ends: 135 [2024-11-18 20:12:00,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 257 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-18 20:12:00,140 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:00,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 159 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:12:00,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-18 20:12:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2024-11-18 20:12:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 85 states have (on average 1.188235294117647) internal successors, (101), 86 states have internal predecessors, (101), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-18 20:12:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 161 transitions. [2024-11-18 20:12:00,168 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 161 transitions. Word has length 130 [2024-11-18 20:12:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:00,168 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 161 transitions. [2024-11-18 20:12:00,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 7 states have internal predecessors, (52), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 20:12:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 161 transitions. [2024-11-18 20:12:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:12:00,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:00,170 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:00,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-18 20:12:00,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-18 20:12:00,370 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:00,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:00,372 INFO L85 PathProgramCache]: Analyzing trace with hash 164005000, now seen corresponding path program 1 times [2024-11-18 20:12:00,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:12:00,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695072937] [2024-11-18 20:12:00,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:00,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:12:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:00,527 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:00,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:12:00,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695072937] [2024-11-18 20:12:00,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695072937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:00,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:00,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:12:00,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730787464] [2024-11-18 20:12:00,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:00,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:12:00,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:12:00,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:12:00,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:12:00,530 INFO L87 Difference]: Start difference. First operand 123 states and 161 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:12:00,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:00,732 INFO L93 Difference]: Finished difference Result 282 states and 368 transitions. [2024-11-18 20:12:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 20:12:00,732 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2024-11-18 20:12:00,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:00,734 INFO L225 Difference]: With dead ends: 282 [2024-11-18 20:12:00,734 INFO L226 Difference]: Without dead ends: 162 [2024-11-18 20:12:00,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:12:00,736 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 112 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:00,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 155 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:12:00,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-18 20:12:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2024-11-18 20:12:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 105 states have (on average 1.1333333333333333) internal successors, (119), 107 states have internal predecessors, (119), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-18 20:12:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 207 transitions. [2024-11-18 20:12:00,800 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 207 transitions. Word has length 130 [2024-11-18 20:12:00,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 207 transitions. [2024-11-18 20:12:00,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:12:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 207 transitions. [2024-11-18 20:12:00,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:12:00,802 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:00,802 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:00,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-18 20:12:00,802 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:00,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:00,805 INFO L85 PathProgramCache]: Analyzing trace with hash 844063370, now seen corresponding path program 1 times [2024-11-18 20:12:00,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:12:00,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907665049] [2024-11-18 20:12:00,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:00,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:12:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:01,072 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:01,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 20:12:01,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907665049] [2024-11-18 20:12:01,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907665049] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:01,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:01,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 20:12:01,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044495328] [2024-11-18 20:12:01,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:01,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 20:12:01,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 20:12:01,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 20:12:01,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:12:01,074 INFO L87 Difference]: Start difference. First operand 161 states and 207 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:01,174 INFO L93 Difference]: Finished difference Result 354 states and 460 transitions. [2024-11-18 20:12:01,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 20:12:01,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2024-11-18 20:12:01,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:01,178 INFO L225 Difference]: With dead ends: 354 [2024-11-18 20:12:01,178 INFO L226 Difference]: Without dead ends: 234 [2024-11-18 20:12:01,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-18 20:12:01,180 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 40 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:01,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 268 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:12:01,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-18 20:12:01,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 186. [2024-11-18 20:12:01,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 130 states have (on average 1.1692307692307693) internal successors, (152), 132 states have internal predecessors, (152), 44 states have call successors, (44), 11 states have call predecessors, (44), 11 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-18 20:12:01,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 240 transitions. [2024-11-18 20:12:01,233 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 240 transitions. Word has length 130 [2024-11-18 20:12:01,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:01,233 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 240 transitions. [2024-11-18 20:12:01,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 240 transitions. [2024-11-18 20:12:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-18 20:12:01,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:01,235 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:01,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-18 20:12:01,235 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:01,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash 34716744, now seen corresponding path program 1 times [2024-11-18 20:12:01,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 20:12:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945554937] [2024-11-18 20:12:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 20:12:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-18 20:12:01,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118010768] [2024-11-18 20:12:01,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:01,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:12:01,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:12:01,295 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-18 20:12:01,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-18 20:12:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:12:01,399 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 20:12:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 20:12:01,522 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 20:12:01,523 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 20:12:01,524 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 20:12:01,540 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-11-18 20:12:01,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-18 20:12:01,729 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:01,819 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 20:12:01,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 08:12:01 BoogieIcfgContainer [2024-11-18 20:12:01,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 20:12:01,822 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 20:12:01,822 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 20:12:01,822 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 20:12:01,823 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:11:54" (3/4) ... [2024-11-18 20:12:01,824 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 20:12:01,826 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 20:12:01,826 INFO L158 Benchmark]: Toolchain (without parser) took 7763.39ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 71.2MB in the beginning and 147.8MB in the end (delta: -76.6MB). Peak memory consumption was 83.5MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,826 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 142.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:12:01,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.77ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 53.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.10ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 49.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,827 INFO L158 Benchmark]: Boogie Preprocessor took 85.48ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 49.2MB in the beginning and 162.4MB in the end (delta: -113.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,827 INFO L158 Benchmark]: RCFGBuilder took 450.88ms. Allocated memory is still 199.2MB. Free memory was 162.4MB in the beginning and 136.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,827 INFO L158 Benchmark]: TraceAbstraction took 6863.69ms. Allocated memory was 199.2MB in the beginning and 302.0MB in the end (delta: 102.8MB). Free memory was 135.1MB in the beginning and 147.8MB in the end (delta: -12.7MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-11-18 20:12:01,828 INFO L158 Benchmark]: Witness Printer took 3.62ms. Allocated memory is still 302.0MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 20:12:01,829 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.15ms. Allocated memory is still 142.6MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.77ms. Allocated memory is still 142.6MB. Free memory was 70.9MB in the beginning and 53.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.10ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 49.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.48ms. Allocated memory was 142.6MB in the beginning and 199.2MB in the end (delta: 56.6MB). Free memory was 49.2MB in the beginning and 162.4MB in the end (delta: -113.2MB). Peak memory consumption was 18.6MB. Max. memory is 16.1GB. * RCFGBuilder took 450.88ms. Allocated memory is still 199.2MB. Free memory was 162.4MB in the beginning and 136.2MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 6863.69ms. Allocated memory was 199.2MB in the beginning and 302.0MB in the end (delta: 102.8MB). Free memory was 135.1MB in the beginning and 147.8MB in the end (delta: -12.7MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 3.62ms. Allocated memory is still 302.0MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someUnaryDOUBLEoperation at line 35. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 128; [L23] signed short int var_1_4 = -200; [L24] unsigned short int var_1_8 = 5; [L25] unsigned char var_1_9 = 1; [L26] unsigned char var_1_10 = 0; [L27] unsigned char var_1_11 = 0; [L28] unsigned char var_1_12 = 16; [L29] unsigned char var_1_15 = 50; [L30] unsigned short int var_1_16 = 1; [L31] float var_1_17 = 25.4; [L32] float var_1_20 = 1.6; [L33] unsigned short int var_1_21 = 0; [L34] float var_1_24 = 128.5; [L35] double var_1_25 = -0.5; [L36] signed long int var_1_26 = 4; [L37] signed char var_1_27 = 2; [L38] signed char var_1_28 = -16; [L39] signed char var_1_29 = 0; [L40] unsigned char var_1_30 = 0; [L41] unsigned long int var_1_34 = 50; [L42] double var_1_35 = 31.1; [L43] unsigned long int var_1_37 = 64; [L44] signed long int var_1_38 = 8; [L45] float var_1_39 = 200.6; [L46] unsigned short int var_1_40 = 2; [L47] signed char var_1_42 = -4; [L48] double var_1_43 = 2.75; [L49] signed char var_1_45 = 32; [L50] unsigned long int var_1_46 = 32; [L51] signed long int var_1_47 = -256; [L52] unsigned char last_1_var_1_9 = 1; [L53] float last_1_var_1_24 = 128.5; VAL [isInitial=0, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] CALL updateLastVariables() [L156] last_1_var_1_9 = var_1_9 [L157] last_1_var_1_24 = var_1_24 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=-200, var_1_8=5, var_1_9=1] [L167] RET updateLastVariables() [L168] CALL updateVariables() [L127] var_1_4 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L128] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L129] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L130] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L130] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=5, var_1_9=1] [L131] var_1_8 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L132] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_9=1] [L133] CALL assume_abort_if_not(var_1_8 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L133] RET assume_abort_if_not(var_1_8 <= 32767) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=0, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L134] var_1_10 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L136] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L137] var_1_11 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L138] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L139] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=50, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L140] var_1_15 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L141] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L142] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_20=8/5, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L143] var_1_20 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L144] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=-16, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L145] var_1_28 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_28 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L146] RET assume_abort_if_not(var_1_28 >= -126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] CALL assume_abort_if_not(var_1_28 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L147] RET assume_abort_if_not(var_1_28 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L148] var_1_29 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_29 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L149] RET assume_abort_if_not(var_1_29 >= 0) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_29 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L150] RET assume_abort_if_not(var_1_29 <= 126) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_39=1003/5, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L151] var_1_39 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L152] RET assume_abort_if_not((var_1_39 >= -922337.2036854776000e+13F && var_1_39 <= -1.0e-20F) || (var_1_39 <= 9223372.036854776000e+12F && var_1_39 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_39 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L153] RET assume_abort_if_not(var_1_39 != 0.0F) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=16, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L168] RET updateVariables() [L169] CALL step() [L57] COND FALSE !((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) [L64] var_1_12 = var_1_15 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L66] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_1=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=1] [L67] COND TRUE (var_1_12 != var_1_4) || stepLocal_1 [L68] var_1_9 = var_1_11 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=4, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L70] var_1_26 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=0, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L71] COND FALSE !((var_1_9 && var_1_11) && var_1_9) [L74] var_1_21 = ((23370 - var_1_15) + var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L76] signed long int stepLocal_2 = -4; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L77] COND FALSE !(! (-4 < var_1_12)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_2=-4, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L80] COND FALSE !(stepLocal_2 > var_1_21) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=1, var_1_17=127/5, var_1_1=128, var_1_21=23370, var_1_24=257/2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L84] var_1_16 = (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15))) [L85] var_1_25 = var_1_20 [L86] unsigned short int stepLocal_0 = var_1_16; VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, stepLocal_0=0, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=128, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L87] COND TRUE ((var_1_16 * var_1_16) / var_1_4) <= stepLocal_0 [L88] var_1_1 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L92] COND FALSE !((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L95] var_1_27 = (((((var_1_28) < 0 ) ? -(var_1_28) : (var_1_28))) - var_1_29) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L96] COND FALSE !(var_1_9 && var_1_11) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L99] COND FALSE !(var_1_28 > var_1_12) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=311/10, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L104] var_1_35 = var_1_20 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L105] COND FALSE !((var_1_9 && var_1_11) && (var_1_21 > var_1_15)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L108] COND FALSE !((((((var_1_20 / var_1_39)) > (var_1_20)) ? ((var_1_20 / var_1_39)) : (var_1_20))) > 100.3) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L113] COND FALSE !(var_1_12 > ((var_1_29 >> 1) + var_1_21)) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L116] COND FALSE !(var_1_11 || var_1_9) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L119] EXPR var_1_12 | var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=32, var_1_46=32, var_1_47=-256, var_1_4=1, var_1_8=0, var_1_9=0] [L119] COND FALSE !(var_1_28 > (var_1_12 | var_1_12)) [L122] var_1_45 = var_1_28 [L123] var_1_46 = var_1_15 [L124] var_1_47 = var_1_12 VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=0, var_1_4=1, var_1_8=0, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160-L161] return (((((((((((var_1_16 * var_1_16) / var_1_4) <= var_1_16) ? (var_1_1 == ((unsigned short int) var_1_12)) : (var_1_1 == ((unsigned short int) (var_1_12 + var_1_12)))) && (((var_1_12 != var_1_4) || var_1_10) ? (var_1_9 == ((unsigned char) var_1_11)) : 1)) && (((last_1_var_1_9 && var_1_11) && (50 > var_1_8)) ? (((- last_1_var_1_24) < last_1_var_1_24) ? (last_1_var_1_9 ? (var_1_12 == ((unsigned char) 5)) : 1) : 1) : (var_1_12 == ((unsigned char) var_1_15)))) && (var_1_16 == ((unsigned short int) (((((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) < (var_1_15)) ? ((((((256) > (var_1_12)) ? (256) : (var_1_12))) + var_1_12)) : (var_1_15)))))) && (((var_1_16 - ((((var_1_1) < 0 ) ? -(var_1_1) : (var_1_1)))) < (var_1_12 - var_1_16)) ? (var_1_17 == ((float) var_1_20)) : 1)) && (((var_1_9 && var_1_11) && var_1_9) ? (var_1_21 == ((unsigned short int) (var_1_26 + (var_1_15 + ((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))))))) : (var_1_21 == ((unsigned short int) ((23370 - var_1_15) + var_1_12))))) && ((! (-4 < var_1_12)) ? (var_1_24 == ((float) var_1_20)) : ((-4 > var_1_21) ? (var_1_24 == ((float) 10.6f)) : 1))) && (var_1_25 == ((double) var_1_20))) && (var_1_26 == ((signed long int) var_1_12)) ; VAL [\result=0, isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=0, var_1_4=1, var_1_8=0, var_1_9=0] [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=0, var_1_4=1, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_24=257/2, last_1_var_1_9=1, var_1_10=1, var_1_11=0, var_1_12=0, var_1_15=0, var_1_16=0, var_1_17=127/5, var_1_1=0, var_1_20=2, var_1_21=23370, var_1_24=257/2, var_1_25=2, var_1_26=0, var_1_27=0, var_1_28=0, var_1_29=0, var_1_30=0, var_1_34=50, var_1_35=2, var_1_37=64, var_1_38=8, var_1_40=2, var_1_42=-4, var_1_43=11/4, var_1_45=0, var_1_46=0, var_1_47=0, var_1_4=1, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.7s, OverallIterations: 10, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1083 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1076 mSDsluCounter, 1990 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1114 mSDsCounter, 252 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 891 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 252 mSolverCounterUnsat, 876 mSDtfsCounter, 891 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 458 GetRequests, 421 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=9, InterpolantAutomatonStates: 45, 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, 9 MinimizatonAttempts, 372 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1688 NumberOfCodeBlocks, 1688 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1546 ConstructedInterpolants, 0 QuantifiedInterpolants, 3661 SizeOfPredicates, 1 NumberOfNonLiveVariables, 679 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 8 PerfectInterpolantSequences, 7229/7344 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 20:12:01,853 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.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 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 20:12:03,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 20:12:03,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-18 20:12:03,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 20:12:03,922 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 20:12:03,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 20:12:03,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 20:12:03,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 20:12:03,951 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 20:12:03,952 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 20:12:03,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 20:12:03,953 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 20:12:03,953 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 20:12:03,954 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 20:12:03,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 20:12:03,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 20:12:03,954 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 20:12:03,957 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-18 20:12:03,957 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-18 20:12:03,957 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 20:12:03,958 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 20:12:03,959 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 20:12:03,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:12:03,960 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 20:12:03,960 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 20:12:03,960 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 20:12:03,960 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 20:12:03,960 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 20:12:03,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 20:12:03,962 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 20:12:03,962 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 20:12:03,962 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 20:12:03,963 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 -> 4e5482dd6ba3374aff0d8883ae694cf340167e4fdd04dcf1b79ac1391ce8afb5 [2024-11-18 20:12:04,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 20:12:04,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 20:12:04,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 20:12:04,270 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 20:12:04,271 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 20:12:04,272 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:12:05,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 20:12:05,885 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 20:12:05,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:12:05,900 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854c36c5e/adfaf818d2ec4d0f8192a1ad98d99291/FLAG399809398 [2024-11-18 20:12:06,266 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854c36c5e/adfaf818d2ec4d0f8192a1ad98d99291 [2024-11-18 20:12:06,268 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 20:12:06,269 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 20:12:06,272 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 20:12:06,272 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 20:12:06,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 20:12:06,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,278 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bfb9f66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06, skipping insertion in model container [2024-11-18 20:12:06,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,307 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 20:12:06,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-18 20:12:06,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:12:06,549 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 20:12:06,559 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i[919,932] [2024-11-18 20:12:06,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 20:12:06,624 INFO L204 MainTranslator]: Completed translation [2024-11-18 20:12:06,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06 WrapperNode [2024-11-18 20:12:06,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 20:12:06,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 20:12:06,626 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 20:12:06,626 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 20:12:06,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,677 INFO L138 Inliner]: procedures = 27, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-18 20:12:06,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 20:12:06,678 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 20:12:06,678 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 20:12:06,678 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 20:12:06,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,694 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,716 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-18 20:12:06,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,727 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,734 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,736 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,738 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 20:12:06,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 20:12:06,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 20:12:06,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 20:12:06,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (1/1) ... [2024-11-18 20:12:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 20:12:06,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 20:12:06,776 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-18 20:12:06,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-18 20:12:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 20:12:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 20:12:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-18 20:12:06,818 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-18 20:12:06,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 20:12:06,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 20:12:06,906 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 20:12:06,908 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 20:12:11,231 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-18 20:12:11,231 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 20:12:11,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 20:12:11,246 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 20:12:11,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:12:11 BoogieIcfgContainer [2024-11-18 20:12:11,246 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 20:12:11,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 20:12:11,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 20:12:11,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 20:12:11,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 08:12:06" (1/3) ... [2024-11-18 20:12:11,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755d757a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:12:11, skipping insertion in model container [2024-11-18 20:12:11,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:12:06" (2/3) ... [2024-11-18 20:12:11,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@755d757a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 08:12:11, skipping insertion in model container [2024-11-18 20:12:11,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:12:11" (3/3) ... [2024-11-18 20:12:11,252 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-40.i [2024-11-18 20:12:11,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 20:12:11,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 20:12:11,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 20:12:11,335 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;@1749b09f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 20:12:11,335 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 20:12:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:12:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-18 20:12:11,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:11,357 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:11,357 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:11,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1643810835, now seen corresponding path program 1 times [2024-11-18 20:12:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:11,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618593203] [2024-11-18 20:12:11,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:11,379 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:11,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:11,383 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:11,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-18 20:12:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:11,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-18 20:12:11,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-18 20:12:11,800 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:12:11,800 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618593203] [2024-11-18 20:12:11,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618593203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:11,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:11,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-18 20:12:11,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512476832] [2024-11-18 20:12:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:11,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-18 20:12:11,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:11,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-18 20:12:11,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:12:11,830 INFO L87 Difference]: Start difference. First operand has 71 states, 50 states have (on average 1.46) internal successors, (73), 51 states have internal predecessors, (73), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:12:11,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:11,859 INFO L93 Difference]: Finished difference Result 135 states and 230 transitions. [2024-11-18 20:12:11,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-18 20:12:11,861 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 128 [2024-11-18 20:12:11,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:11,867 INFO L225 Difference]: With dead ends: 135 [2024-11-18 20:12:11,869 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 20:12:11,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-18 20:12:11,877 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:11,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 20:12:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 20:12:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 20:12:11,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-18 20:12:11,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 101 transitions. [2024-11-18 20:12:11,926 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 101 transitions. Word has length 128 [2024-11-18 20:12:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:11,927 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 101 transitions. [2024-11-18 20:12:11,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-18 20:12:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 101 transitions. [2024-11-18 20:12:11,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:11,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:11,934 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:11,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-18 20:12:12,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:12,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:12,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:12,136 INFO L85 PathProgramCache]: Analyzing trace with hash 876816405, now seen corresponding path program 1 times [2024-11-18 20:12:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:12,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291367367] [2024-11-18 20:12:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:12,139 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:12,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-18 20:12:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:12,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:12:12,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 321 proven. 27 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-18 20:12:13,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:12:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 24 proven. 27 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-18 20:12:13,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291367367] [2024-11-18 20:12:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291367367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 20:12:13,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 20:12:13,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-18 20:12:13,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317893985] [2024-11-18 20:12:13,509 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 20:12:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 20:12:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:13,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 20:12:13,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-18 20:12:13,513 INFO L87 Difference]: Start difference. First operand 67 states and 101 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 20:12:14,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:14,770 INFO L93 Difference]: Finished difference Result 207 states and 303 transitions. [2024-11-18 20:12:14,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-18 20:12:14,771 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 129 [2024-11-18 20:12:14,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:14,773 INFO L225 Difference]: With dead ends: 207 [2024-11-18 20:12:14,773 INFO L226 Difference]: Without dead ends: 143 [2024-11-18 20:12:14,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-18 20:12:14,775 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 228 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:14,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 275 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-18 20:12:14,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-18 20:12:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 133. [2024-11-18 20:12:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.25) internal successors, (115), 92 states have internal predecessors, (115), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:12:14,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 187 transitions. [2024-11-18 20:12:14,797 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 187 transitions. Word has length 129 [2024-11-18 20:12:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:14,798 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 187 transitions. [2024-11-18 20:12:14,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (27), 2 states have call predecessors, (27), 4 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-18 20:12:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 187 transitions. [2024-11-18 20:12:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:14,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:14,799 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:14,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-18 20:12:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:15,001 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 2094692569, now seen corresponding path program 1 times [2024-11-18 20:12:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570342778] [2024-11-18 20:12:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:15,002 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:15,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:15,003 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:15,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-18 20:12:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:15,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 20:12:15,335 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:15,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:12:15,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570342778] [2024-11-18 20:12:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570342778] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:15,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:12:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255970167] [2024-11-18 20:12:15,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:15,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:12:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:12:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:12:15,370 INFO L87 Difference]: Start difference. First operand 133 states and 187 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:15,514 INFO L93 Difference]: Finished difference Result 263 states and 371 transitions. [2024-11-18 20:12:15,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:12:15,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:12:15,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:15,525 INFO L225 Difference]: With dead ends: 263 [2024-11-18 20:12:15,525 INFO L226 Difference]: Without dead ends: 133 [2024-11-18 20:12:15,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-11-18 20:12:15,529 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:15,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 20:12:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-18 20:12:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-11-18 20:12:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.2282608695652173) internal successors, (113), 92 states have internal predecessors, (113), 36 states have call successors, (36), 4 states have call predecessors, (36), 4 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-11-18 20:12:15,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-18 20:12:15,556 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 129 [2024-11-18 20:12:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:15,557 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-18 20:12:15,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-18 20:12:15,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:15,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:15,559 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:15,573 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-11-18 20:12:15,759 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-11-18 20:12:15,760 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:15,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:15,760 INFO L85 PathProgramCache]: Analyzing trace with hash 100547863, now seen corresponding path program 1 times [2024-11-18 20:12:15,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:15,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209565503] [2024-11-18 20:12:15,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:15,761 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:15,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:15,764 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:15,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-18 20:12:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:16,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-18 20:12:16,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:16,292 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:16,292 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:12:16,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:16,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209565503] [2024-11-18 20:12:16,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209565503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:16,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:16,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 20:12:16,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876640307] [2024-11-18 20:12:16,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:16,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 20:12:16,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:16,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 20:12:16,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 20:12:16,294 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:17,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:17,132 INFO L93 Difference]: Finished difference Result 429 states and 593 transitions. [2024-11-18 20:12:17,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-18 20:12:17,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:12:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:17,135 INFO L225 Difference]: With dead ends: 429 [2024-11-18 20:12:17,135 INFO L226 Difference]: Without dead ends: 299 [2024-11-18 20:12:17,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:12:17,143 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 197 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:17,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 317 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-18 20:12:17,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2024-11-18 20:12:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 179. [2024-11-18 20:12:17,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 117 states have internal predecessors, (137), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 20:12:17,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 245 transitions. [2024-11-18 20:12:17,190 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 245 transitions. Word has length 129 [2024-11-18 20:12:17,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:17,192 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 245 transitions. [2024-11-18 20:12:17,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 245 transitions. [2024-11-18 20:12:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:17,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:17,194 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:17,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-18 20:12:17,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:17,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:17,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:17,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1179315815, now seen corresponding path program 1 times [2024-11-18 20:12:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1779519698] [2024-11-18 20:12:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:17,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:17,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:17,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-18 20:12:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:17,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-18 20:12:17,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:18,154 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 213 proven. 9 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2024-11-18 20:12:18,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 20:12:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:18,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:18,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1779519698] [2024-11-18 20:12:18,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1779519698] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-18 20:12:18,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-18 20:12:18,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-18 20:12:18,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62879417] [2024-11-18 20:12:18,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:18,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:12:18,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:18,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:12:18,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:12:18,489 INFO L87 Difference]: Start difference. First operand 179 states and 245 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:18,959 INFO L93 Difference]: Finished difference Result 327 states and 441 transitions. [2024-11-18 20:12:18,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:12:18,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:12:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:18,963 INFO L225 Difference]: With dead ends: 327 [2024-11-18 20:12:18,963 INFO L226 Difference]: Without dead ends: 187 [2024-11-18 20:12:18,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 251 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-18 20:12:18,964 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 59 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:18,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 161 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-18 20:12:18,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-18 20:12:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2024-11-18 20:12:18,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 122 states have (on average 1.1557377049180328) internal successors, (141), 123 states have internal predecessors, (141), 54 states have call successors, (54), 10 states have call predecessors, (54), 10 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-18 20:12:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 249 transitions. [2024-11-18 20:12:18,989 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 249 transitions. Word has length 129 [2024-11-18 20:12:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:18,990 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 249 transitions. [2024-11-18 20:12:18,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 249 transitions. [2024-11-18 20:12:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:18,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:18,994 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:19,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-18 20:12:19,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:19,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:19,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:19,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1988662441, now seen corresponding path program 1 times [2024-11-18 20:12:19,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:19,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228648336] [2024-11-18 20:12:19,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:19,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:19,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:19,199 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:19,200 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 (7)] Waiting until timeout for monitored process [2024-11-18 20:12:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:19,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-18 20:12:19,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 20:12:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-18 20:12:19,581 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 20:12:19,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 20:12:19,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228648336] [2024-11-18 20:12:19,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228648336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 20:12:19,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 20:12:19,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-18 20:12:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531211784] [2024-11-18 20:12:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 20:12:19,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-18 20:12:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 20:12:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-18 20:12:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-18 20:12:19,583 INFO L87 Difference]: Start difference. First operand 187 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:20,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 20:12:20,150 INFO L93 Difference]: Finished difference Result 429 states and 562 transitions. [2024-11-18 20:12:20,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-18 20:12:20,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2024-11-18 20:12:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 20:12:20,163 INFO L225 Difference]: With dead ends: 429 [2024-11-18 20:12:20,165 INFO L226 Difference]: Without dead ends: 281 [2024-11-18 20:12:20,166 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 127 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-11-18 20:12:20,167 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 48 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-18 20:12:20,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 149 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-18 20:12:20,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-18 20:12:20,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 277. [2024-11-18 20:12:20,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 181 states have (on average 1.143646408839779) internal successors, (207), 184 states have internal predecessors, (207), 78 states have call successors, (78), 17 states have call predecessors, (78), 17 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2024-11-18 20:12:20,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 363 transitions. [2024-11-18 20:12:20,197 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 363 transitions. Word has length 129 [2024-11-18 20:12:20,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 20:12:20,197 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 363 transitions. [2024-11-18 20:12:20,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2024-11-18 20:12:20,198 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 363 transitions. [2024-11-18 20:12:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-18 20:12:20,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 20:12:20,199 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 20:12:20,211 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 (7)] Ended with exit code 0 [2024-11-18 20:12:20,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:20,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 20:12:20,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 20:12:20,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1931404139, now seen corresponding path program 1 times [2024-11-18 20:12:20,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 20:12:20,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1207241803] [2024-11-18 20:12:20,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 20:12:20,401 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-18 20:12:20,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 20:12:20,403 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-18 20:12:20,404 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 (8)] Waiting until timeout for monitored process [2024-11-18 20:12:20,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 20:12:20,790 INFO L255 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-18 20:12:20,794 INFO L278 TraceCheckSpWp]: Computing forward predicates...