./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-17.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 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:06:50,628 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:06:50,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 21:06:50,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:06:50,704 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:06:50,729 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:06:50,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:06:50,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:06:50,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:06:50,731 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:06:50,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:06:50,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:06:50,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:06:50,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:06:50,733 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:06:50,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:06:50,734 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:06:50,734 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:06:50,734 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 21:06:50,734 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:06:50,735 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:06:50,738 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:06:50,738 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:06:50,738 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:06:50,738 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:06:50,738 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:06:50,739 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:06:50,739 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:50,740 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:06:50,740 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:06:50,740 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:06:50,740 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 21:06:50,740 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 21:06:50,740 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:06:50,741 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:06:50,741 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:06:50,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:06:50,743 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 -> 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a [2024-11-08 21:06:50,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:06:50,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:06:50,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:06:50,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:06:50,971 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:06:50,971 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-17.i [2024-11-08 21:06:52,323 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:06:52,478 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:06:52,479 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-11-08 21:06:52,492 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f763156/9e6a0004cc4041b2ae86869a9f1b7cf6/FLAGdc9456c54 [2024-11-08 21:06:52,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f763156/9e6a0004cc4041b2ae86869a9f1b7cf6 [2024-11-08 21:06:52,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:06:52,508 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:06:52,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:52,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:06:52,518 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:06:52,519 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413a3efe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52, skipping insertion in model container [2024-11-08 21:06:52,520 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,543 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:06:52,672 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-17.i[919,932] [2024-11-08 21:06:52,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:52,731 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:06:52,746 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-17.i[919,932] [2024-11-08 21:06:52,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:06:52,796 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:06:52,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52 WrapperNode [2024-11-08 21:06:52,802 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:06:52,804 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:52,804 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:06:52,805 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:06:52,810 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,823 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,859 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-08 21:06:52,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:06:52,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:06:52,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:06:52,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:06:52,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,875 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,890 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-08 21:06:52,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,899 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,901 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,904 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,906 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,909 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:06:52,910 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:06:52,910 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:06:52,910 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:06:52,911 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (1/1) ... [2024-11-08 21:06:52,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:52,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:52,949 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-08 21:06:52,972 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-08 21:06:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:06:53,022 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:06:53,023 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:06:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 21:06:53,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:06:53,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:06:53,116 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:06:53,117 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:06:53,433 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 21:06:53,433 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:06:53,447 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:06:53,448 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:06:53,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:53 BoogieIcfgContainer [2024-11-08 21:06:53,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:06:53,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:06:53,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:06:53,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:06:53,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:06:52" (1/3) ... [2024-11-08 21:06:53,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442bec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:53, skipping insertion in model container [2024-11-08 21:06:53,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:06:52" (2/3) ... [2024-11-08 21:06:53,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@442bec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:06:53, skipping insertion in model container [2024-11-08 21:06:53,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:53" (3/3) ... [2024-11-08 21:06:53,458 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-11-08 21:06:53,472 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:06:53,472 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:06:53,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:06:53,523 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;@1840781b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:06:53,523 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:06:53,527 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 21:06:53,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 21:06:53,537 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:53,538 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:53,538 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:53,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:53,542 INFO L85 PathProgramCache]: Analyzing trace with hash -585540213, now seen corresponding path program 1 times [2024-11-08 21:06:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897323749] [2024-11-08 21:06:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:53,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:53,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:06:53,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:06:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:06:53,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:06:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:06:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:06:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:06:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:06:53,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:06:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:06:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:06:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:06:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:06:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:06:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:06:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:06:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 21:06:53,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:53,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897323749] [2024-11-08 21:06:53,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897323749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:53,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:53,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:06:53,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795186045] [2024-11-08 21:06:53,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:53,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:06:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:53,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:06:53,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:06:53,922 INFO L87 Difference]: Start difference. First operand has 95 states, 72 states have (on average 1.5) internal successors, (108), 73 states have internal predecessors, (108), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 21:06:53,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:53,951 INFO L93 Difference]: Finished difference Result 183 states and 310 transitions. [2024-11-08 21:06:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:06:53,953 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 141 [2024-11-08 21:06:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:53,960 INFO L225 Difference]: With dead ends: 183 [2024-11-08 21:06:53,960 INFO L226 Difference]: Without dead ends: 91 [2024-11-08 21:06:53,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:06:53,968 INFO L432 NwaCegarLoop]: 140 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, 140 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-08 21:06:53,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:06:53,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-08 21:06:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-08 21:06:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 21:06:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 140 transitions. [2024-11-08 21:06:54,013 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 140 transitions. Word has length 141 [2024-11-08 21:06:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:54,014 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 140 transitions. [2024-11-08 21:06:54,014 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 21:06:54,014 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 140 transitions. [2024-11-08 21:06:54,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 21:06:54,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:54,021 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:54,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 21:06:54,022 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:54,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:54,023 INFO L85 PathProgramCache]: Analyzing trace with hash -680876345, now seen corresponding path program 1 times [2024-11-08 21:06:54,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:54,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903644217] [2024-11-08 21:06:54,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:54,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:54,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:06:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:06:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:06:54,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:06:54,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:06:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:06:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:06:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:06:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:06:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:06:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:06:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:06:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:06:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:06:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:06:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:06:54,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 21:06:54,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:54,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903644217] [2024-11-08 21:06:54,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903644217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:54,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:54,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:06:54,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762749064] [2024-11-08 21:06:54,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:54,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:06:54,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:54,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:06:54,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:06:54,383 INFO L87 Difference]: Start difference. First operand 91 states and 140 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:54,535 INFO L93 Difference]: Finished difference Result 320 states and 493 transitions. [2024-11-08 21:06:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:06:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-08 21:06:54,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:54,539 INFO L225 Difference]: With dead ends: 320 [2024-11-08 21:06:54,541 INFO L226 Difference]: Without dead ends: 232 [2024-11-08 21:06:54,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:06:54,543 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 195 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:54,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 572 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:06:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-08 21:06:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 227. [2024-11-08 21:06:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 179 states have (on average 1.4748603351955307) internal successors, (264), 180 states have internal predecessors, (264), 44 states have call successors, (44), 3 states have call predecessors, (44), 3 states have return successors, (44), 43 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-08 21:06:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 352 transitions. [2024-11-08 21:06:54,583 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 352 transitions. Word has length 141 [2024-11-08 21:06:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:54,584 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 352 transitions. [2024-11-08 21:06:54,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 352 transitions. [2024-11-08 21:06:54,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-08 21:06:54,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:54,586 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:54,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 21:06:54,586 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:54,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:54,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1619946245, now seen corresponding path program 1 times [2024-11-08 21:06:54,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:54,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488876329] [2024-11-08 21:06:54,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:54,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:06:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:06:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:54,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:06:55,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:06:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:06:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:06:55,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:06:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:06:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:06:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:06:55,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:06:55,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:06:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:06:55,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:06:55,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:06:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:06:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,060 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 21:06:55,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:55,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488876329] [2024-11-08 21:06:55,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488876329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:55,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:55,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:06:55,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490339337] [2024-11-08 21:06:55,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:55,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:06:55,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:55,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:06:55,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:06:55,064 INFO L87 Difference]: Start difference. First operand 227 states and 352 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:55,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:55,198 INFO L93 Difference]: Finished difference Result 624 states and 972 transitions. [2024-11-08 21:06:55,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:06:55,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 141 [2024-11-08 21:06:55,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:55,202 INFO L225 Difference]: With dead ends: 624 [2024-11-08 21:06:55,202 INFO L226 Difference]: Without dead ends: 400 [2024-11-08 21:06:55,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:06:55,204 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 102 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:55,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 483 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:06:55,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2024-11-08 21:06:55,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 266. [2024-11-08 21:06:55,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 197 states have (on average 1.4314720812182742) internal successors, (282), 198 states have internal predecessors, (282), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-08 21:06:55,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 410 transitions. [2024-11-08 21:06:55,224 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 410 transitions. Word has length 141 [2024-11-08 21:06:55,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:55,225 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 410 transitions. [2024-11-08 21:06:55,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:55,225 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 410 transitions. [2024-11-08 21:06:55,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 21:06:55,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:55,227 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:55,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 21:06:55,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:55,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:55,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1274267626, now seen corresponding path program 1 times [2024-11-08 21:06:55,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:55,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138764098] [2024-11-08 21:06:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:06:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:06:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:06:55,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:06:55,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:06:55,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:06:55,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:06:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:06:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:06:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:06:55,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:06:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:06:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:06:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:06:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:55,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:06:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:06:55,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,642 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 21:06:55,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:55,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138764098] [2024-11-08 21:06:55,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138764098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:06:55,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:06:55,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 21:06:55,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677891692] [2024-11-08 21:06:55,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:06:55,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:06:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:55,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:06:55,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:06:55,645 INFO L87 Difference]: Start difference. First operand 266 states and 410 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:55,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:55,812 INFO L93 Difference]: Finished difference Result 841 states and 1292 transitions. [2024-11-08 21:06:55,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:06:55,813 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 142 [2024-11-08 21:06:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:55,816 INFO L225 Difference]: With dead ends: 841 [2024-11-08 21:06:55,816 INFO L226 Difference]: Without dead ends: 617 [2024-11-08 21:06:55,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-08 21:06:55,818 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 241 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:55,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 377 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 21:06:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2024-11-08 21:06:55,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 540. [2024-11-08 21:06:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 443 states have (on average 1.4808126410835214) internal successors, (656), 447 states have internal predecessors, (656), 88 states have call successors, (88), 8 states have call predecessors, (88), 8 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 21:06:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 832 transitions. [2024-11-08 21:06:55,844 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 832 transitions. Word has length 142 [2024-11-08 21:06:55,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:55,845 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 832 transitions. [2024-11-08 21:06:55,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:06:55,845 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 832 transitions. [2024-11-08 21:06:55,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 21:06:55,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:55,847 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:55,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 21:06:55,847 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:55,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:55,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1667294636, now seen corresponding path program 1 times [2024-11-08 21:06:55,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:55,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551147902] [2024-11-08 21:06:55,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:55,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:55,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 21:06:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 21:06:55,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 21:06:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 21:06:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 21:06:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 21:06:55,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 21:06:55,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 21:06:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 21:06:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 21:06:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:55,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 21:06:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 21:06:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 21:06:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 21:06:56,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 21:06:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 21:06:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-08 21:06:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-08 21:06:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-08 21:06:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-08 21:06:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 21:06:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 21:06:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551147902] [2024-11-08 21:06:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551147902] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 21:06:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117317794] [2024-11-08 21:06:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:56,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:06:56,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:56,037 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-08 21:06:56,038 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-08 21:06:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:06:56,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:06:56,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:06:56,296 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-08 21:06:56,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:06:56,536 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 21:06:56,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117317794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:06:56,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 21:06:56,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-08 21:06:56,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8063753] [2024-11-08 21:06:56,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 21:06:56,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 21:06:56,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 21:06:56,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 21:06:56,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:06:56,539 INFO L87 Difference]: Start difference. First operand 540 states and 832 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:06:56,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:06:56,766 INFO L93 Difference]: Finished difference Result 988 states and 1507 transitions. [2024-11-08 21:06:56,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 21:06:56,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 142 [2024-11-08 21:06:56,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:06:56,769 INFO L225 Difference]: With dead ends: 988 [2024-11-08 21:06:56,770 INFO L226 Difference]: Without dead ends: 448 [2024-11-08 21:06:56,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 320 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:06:56,771 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 188 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 21:06:56,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 294 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 21:06:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-11-08 21:06:56,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 434. [2024-11-08 21:06:56,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 334 states have (on average 1.3592814371257484) internal successors, (454), 338 states have internal predecessors, (454), 88 states have call successors, (88), 11 states have call predecessors, (88), 11 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2024-11-08 21:06:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 630 transitions. [2024-11-08 21:06:56,797 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 630 transitions. Word has length 142 [2024-11-08 21:06:56,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:06:56,797 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 630 transitions. [2024-11-08 21:06:56,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:06:56,797 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 630 transitions. [2024-11-08 21:06:56,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-08 21:06:56,799 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:06:56,799 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:06:56,813 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-08 21:06:56,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:06:57,000 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:06:57,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:06:57,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2091916076, now seen corresponding path program 1 times [2024-11-08 21:06:57,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 21:06:57,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111946124] [2024-11-08 21:06:57,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:57,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 21:06:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 21:06:57,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1625922710] [2024-11-08 21:06:57,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:06:57,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 21:06:57,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:06:57,045 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-08 21:06:57,046 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-08 21:06:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:06:57,125 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 21:06:57,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 21:06:57,238 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 21:06:57,238 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 21:06:57,239 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 21:06:57,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 21:06:57,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-08 21:06:57,448 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 21:06:57,521 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 21:06:57,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 09:06:57 BoogieIcfgContainer [2024-11-08 21:06:57,523 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 21:06:57,524 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 21:06:57,524 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 21:06:57,524 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 21:06:57,524 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:06:53" (3/4) ... [2024-11-08 21:06:57,526 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 21:06:57,527 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 21:06:57,527 INFO L158 Benchmark]: Toolchain (without parser) took 5019.10ms. Allocated memory was 176.2MB in the beginning and 308.3MB in the end (delta: 132.1MB). Free memory was 117.4MB in the beginning and 139.6MB in the end (delta: -22.2MB). Peak memory consumption was 111.5MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,527 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 176.2MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:06:57,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 292.99ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 100.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.18ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 95.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,528 INFO L158 Benchmark]: Boogie Preprocessor took 48.39ms. Allocated memory is still 176.2MB. Free memory was 95.1MB in the beginning and 89.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,528 INFO L158 Benchmark]: RCFGBuilder took 539.17ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 88.8MB in the beginning and 198.2MB in the end (delta: -109.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,529 INFO L158 Benchmark]: TraceAbstraction took 4072.08ms. Allocated memory was 255.9MB in the beginning and 308.3MB in the end (delta: 52.4MB). Free memory was 197.2MB in the beginning and 140.6MB in the end (delta: 56.6MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. [2024-11-08 21:06:57,529 INFO L158 Benchmark]: Witness Printer took 3.12ms. Allocated memory is still 308.3MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 21:06:57,530 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 176.2MB. Free memory is still 135.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 292.99ms. Allocated memory is still 176.2MB. Free memory was 117.0MB in the beginning and 100.1MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.18ms. Allocated memory is still 176.2MB. Free memory was 99.7MB in the beginning and 95.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.39ms. Allocated memory is still 176.2MB. Free memory was 95.1MB in the beginning and 89.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 539.17ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 88.8MB in the beginning and 198.2MB in the end (delta: -109.4MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4072.08ms. Allocated memory was 255.9MB in the beginning and 308.3MB in the end (delta: 52.4MB). Free memory was 197.2MB in the beginning and 140.6MB in the end (delta: 56.6MB). Peak memory consumption was 109.0MB. Max. memory is 16.1GB. * Witness Printer took 3.12ms. Allocated memory is still 308.3MB. Free memory was 140.6MB in the beginning and 139.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 173. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 25; [L23] unsigned char var_1_2 = 25; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_4 = 0; [L26] signed long int var_1_5 = 4; [L27] unsigned char var_1_7 = 0; [L28] unsigned char var_1_8 = 1; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 7.3; [L32] double var_1_12 = 1.25; [L33] double var_1_13 = 128.8; [L34] signed char var_1_14 = -1; [L35] signed char var_1_15 = 10; [L36] signed short int var_1_16 = 8; [L37] unsigned long int var_1_18 = 128; [L38] unsigned long int var_1_19 = 3963666122; [L39] float var_1_20 = 15.875; [L40] signed short int var_1_23 = -10; [L41] unsigned long int var_1_30 = 1000000000; [L42] float var_1_33 = 99.25; [L43] signed long int var_1_34 = 10; [L44] unsigned char var_1_35 = 16; [L45] signed long int var_1_39 = -128; [L46] signed long int var_1_40 = 1792665454; [L47] unsigned char last_1_var_1_8 = 1; [L48] signed char last_1_var_1_14 = -1; VAL [isInitial=0, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L177] isInitial = 1 [L178] FCALL initially() [L179] COND TRUE 1 [L180] CALL updateLastVariables() [L169] last_1_var_1_8 = var_1_8 [L170] last_1_var_1_14 = var_1_14 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=25, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L180] RET updateLastVariables() [L181] CALL updateVariables() [L136] var_1_2 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L137] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_2 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L138] RET assume_abort_if_not(var_1_2 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L139] var_1_3 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L140] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L141] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L142] var_1_4 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L143] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L144] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=0, var_1_8=1, var_1_9=0] [L145] var_1_7 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L146] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_8=1, var_1_9=0] [L147] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=0] [L148] var_1_9 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L149] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L150] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L150] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=0, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L151] var_1_10 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L152] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L153] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L153] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=5/4, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L154] var_1_12 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L155] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_13=644/5, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L156] var_1_13 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L157] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=10, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L159] RET assume_abort_if_not(var_1_15 >= -127) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_15 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L160] RET assume_abort_if_not(var_1_15 <= 126) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=3963666122, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L161] var_1_19 = __VERIFIER_nondet_ulong() [L162] CALL assume_abort_if_not(var_1_19 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L162] RET assume_abort_if_not(var_1_19 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_19 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L163] RET assume_abort_if_not(var_1_19 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1792665454, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L164] var_1_40 = __VERIFIER_nondet_long() [L165] CALL assume_abort_if_not(var_1_40 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L165] RET assume_abort_if_not(var_1_40 >= 1073741823) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_40 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L166] RET assume_abort_if_not(var_1_40 <= 2147483646) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L181] RET updateVariables() [L182] CALL step() [L52] unsigned char stepLocal_0 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_0=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L53] COND TRUE stepLocal_0 && last_1_var_1_8 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=4, var_1_7=-255, var_1_8=1, var_1_9=1] [L54] COND TRUE \read(last_1_var_1_8) [L55] var_1_5 = (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=1, var_1_9=1] [L60] COND FALSE !(var_1_5 < var_1_3) [L63] var_1_8 = (! var_1_10) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=25, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L65] var_1_1 = (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L66] COND FALSE !((64.4f + 1.5f) <= var_1_13) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L71] unsigned char stepLocal_3 = var_1_9 && var_1_8; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_3=0, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=128, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L72] COND FALSE !(stepLocal_3 || (var_1_8 && var_1_10)) [L75] var_1_18 = var_1_2 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L77] signed long int stepLocal_1 = 8 + var_1_14; VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_1=7, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L78] COND FALSE !(var_1_4 == stepLocal_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L81] EXPR var_1_15 & var_1_1 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L81] unsigned long int stepLocal_2 = var_1_18 * (var_1_15 & var_1_1); [L82] COND FALSE !(var_1_12 >= 9.6) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=127/8, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L93] var_1_20 = ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L94] COND FALSE !(128u <= var_1_1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=1000000000, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L109] COND TRUE var_1_2 >= var_1_2 [L110] var_1_30 = (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) - var_1_3) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=397/4, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L112] var_1_33 = var_1_12 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=10, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L113] COND TRUE \read(var_1_10) [L114] var_1_34 = ((((var_1_4) < 0 ) ? -(var_1_4) : (var_1_4))) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=16, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L116] COND TRUE var_1_19 > var_1_3 [L117] var_1_35 = var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L125] EXPR var_1_4 >> var_1_4 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=-128, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L125] COND FALSE !(var_1_2 > (var_1_4 >> var_1_4)) [L132] var_1_39 = var_1_2 VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, stepLocal_2=0, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L182] RET step() [L183] CALL, EXPR property() [L173] EXPR (((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L173-L174] return ((((((var_1_1 == ((unsigned char) (50 + ((((var_1_2) < (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))) ? (var_1_2) : (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))))))))) && ((last_1_var_1_8 && last_1_var_1_8) ? (last_1_var_1_8 ? (var_1_5 == ((signed long int) (((((last_1_var_1_14) < 0 ) ? -(last_1_var_1_14) : (last_1_var_1_14))) - ((((var_1_4) < (var_1_2)) ? (var_1_4) : (var_1_2)))))) : (var_1_5 == ((signed long int) 8))) : 1)) && ((var_1_5 < var_1_3) ? (var_1_8 == ((unsigned char) ((var_1_7 || (last_1_var_1_8 || var_1_9)) && var_1_10))) : (var_1_8 == ((unsigned char) (! var_1_10))))) && ((var_1_4 == (8 + var_1_14)) ? (var_1_11 == ((double) ((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) : 1)) && (((64.4f + 1.5f) <= var_1_13) ? ((var_1_1 >= var_1_4) ? (var_1_14 == ((signed char) var_1_15)) : 1) : 1)) && ((var_1_12 >= 9.6) ? (var_1_10 ? (var_1_16 == ((signed short int) (2 - var_1_1))) : (((var_1_18 * (var_1_15 & var_1_1)) <= var_1_3) ? (var_1_16 == ((signed short int) var_1_18)) : (var_1_16 == ((signed short int) var_1_4)))) : 1)) && (((var_1_9 && var_1_8) || (var_1_8 && var_1_10)) ? (var_1_18 == ((unsigned long int) (var_1_19 - (((((1991720936u - var_1_1)) < (var_1_2)) ? ((1991720936u - var_1_1)) : (var_1_2)))))) : (var_1_18 == ((unsigned long int) var_1_2))) ; [L183] RET, EXPR property() [L183] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=-1, last_1_var_1_8=1, var_1_10=1, var_1_11=73/10, var_1_12=3, var_1_13=2, var_1_14=-1, var_1_15=0, var_1_16=8, var_1_18=0, var_1_19=-2147483649, var_1_1=50, var_1_20=2, var_1_23=-10, var_1_2=0, var_1_30=-2147483649, var_1_33=3, var_1_34=0, var_1_35=0, var_1_39=0, var_1_3=0, var_1_40=1073741823, var_1_4=0, var_1_5=1, var_1_7=-255, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 95 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 6, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 736 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 1866 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1188 mSDsCounter, 138 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 439 IncrementalHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 138 mSolverCounterUnsat, 678 mSDtfsCounter, 439 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 533 GetRequests, 510 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=4, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 230 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1133 NumberOfCodeBlocks, 1133 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 984 ConstructedInterpolants, 0 QuantifiedInterpolants, 2029 SizeOfPredicates, 0 NumberOfNonLiveVariables, 338 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 5239/5320 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-08 21:06:57,557 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-17.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 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 21:06:59,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 21:06:59,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 21:06:59,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 21:06:59,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 21:06:59,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 21:06:59,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 21:06:59,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 21:06:59,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 21:06:59,797 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 21:06:59,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 21:06:59,798 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 21:06:59,798 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 21:06:59,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 21:06:59,799 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 21:06:59,799 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 21:06:59,799 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 21:06:59,800 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 21:06:59,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 21:06:59,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 21:06:59,801 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 21:06:59,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 21:06:59,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 21:06:59,801 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 21:06:59,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 21:06:59,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 21:06:59,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 21:06:59,802 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 21:06:59,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 21:06:59,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 21:06:59,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 21:06:59,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 21:06:59,804 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 21:06:59,804 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 21:06:59,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:06:59,804 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 21:06:59,811 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 21:06:59,811 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 21:06:59,811 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 21:06:59,812 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 21:06:59,812 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 21:06:59,812 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 21:06:59,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 21:06:59,813 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 21:06:59,813 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 -> 5542c934b0500896737ec6dd9b5fa5cdab93ba295214dc1f80eeb0253f65443a [2024-11-08 21:07:00,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 21:07:00,159 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 21:07:00,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 21:07:00,163 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 21:07:00,164 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 21:07:00,165 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-17.i [2024-11-08 21:07:01,577 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 21:07:01,784 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 21:07:01,785 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-11-08 21:07:01,798 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a770ff8be/8c24b9f92c55492fbd4f6d989ce6ce39/FLAG73ea39b5e [2024-11-08 21:07:01,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a770ff8be/8c24b9f92c55492fbd4f6d989ce6ce39 [2024-11-08 21:07:01,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 21:07:01,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 21:07:01,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:01,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 21:07:01,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 21:07:01,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:01" (1/1) ... [2024-11-08 21:07:01,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a7fc51c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:01, skipping insertion in model container [2024-11-08 21:07:01,825 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 09:07:01" (1/1) ... [2024-11-08 21:07:01,847 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 21:07:01,994 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-17.i[919,932] [2024-11-08 21:07:02,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:02,073 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 21:07:02,084 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-17.i[919,932] [2024-11-08 21:07:02,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 21:07:02,138 INFO L204 MainTranslator]: Completed translation [2024-11-08 21:07:02,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02 WrapperNode [2024-11-08 21:07:02,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 21:07:02,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:02,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 21:07:02,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 21:07:02,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,184 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 166 [2024-11-08 21:07:02,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 21:07:02,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 21:07:02,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 21:07:02,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 21:07:02,199 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,218 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-08 21:07:02,218 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,218 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 21:07:02,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 21:07:02,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 21:07:02,232 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 21:07:02,233 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (1/1) ... [2024-11-08 21:07:02,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 21:07:02,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 21:07:02,270 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-08 21:07:02,273 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-08 21:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 21:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 21:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 21:07:02,306 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 21:07:02,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 21:07:02,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 21:07:02,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 21:07:02,382 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 21:07:03,107 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 21:07:03,107 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 21:07:03,119 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 21:07:03,119 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 21:07:03,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:03 BoogieIcfgContainer [2024-11-08 21:07:03,119 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 21:07:03,121 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 21:07:03,121 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 21:07:03,123 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 21:07:03,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 09:07:01" (1/3) ... [2024-11-08 21:07:03,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c46fe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:03, skipping insertion in model container [2024-11-08 21:07:03,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 09:07:02" (2/3) ... [2024-11-08 21:07:03,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c46fe5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 09:07:03, skipping insertion in model container [2024-11-08 21:07:03,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 09:07:03" (3/3) ... [2024-11-08 21:07:03,126 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-17.i [2024-11-08 21:07:03,138 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 21:07:03,139 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 21:07:03,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 21:07:03,200 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;@31602370, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 21:07:03,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 21:07:03,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 21:07:03,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:07:03,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:03,217 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:07:03,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:03,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:03,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1132880626, now seen corresponding path program 1 times [2024-11-08 21:07:03,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018549509] [2024-11-08 21:07:03,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:03,236 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-08 21:07:03,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:03,239 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-08 21:07:03,240 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-08 21:07:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:03,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 21:07:03,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2024-11-08 21:07:03,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:07:03,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:07:03,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018549509] [2024-11-08 21:07:03,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018549509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:03,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:03,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 21:07:03,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693160443] [2024-11-08 21:07:03,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:03,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 21:07:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:07:03,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 21:07:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 21:07:03,514 INFO L87 Difference]: Start difference. First operand has 77 states, 54 states have (on average 1.4814814814814814) internal successors, (80), 55 states have internal predecessors, (80), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 21:07:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:03,536 INFO L93 Difference]: Finished difference Result 147 states and 254 transitions. [2024-11-08 21:07:03,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 21:07:03,541 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 137 [2024-11-08 21:07:03,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:03,547 INFO L225 Difference]: With dead ends: 147 [2024-11-08 21:07:03,547 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 21:07:03,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 136 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-08 21:07:03,552 INFO L432 NwaCegarLoop]: 112 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, 112 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-08 21:07:03,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 21:07:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 21:07:03,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-08 21:07:03,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.411764705882353) internal successors, (72), 51 states have internal predecessors, (72), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-08 21:07:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2024-11-08 21:07:03,585 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 137 [2024-11-08 21:07:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:03,586 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2024-11-08 21:07:03,586 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, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-08 21:07:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2024-11-08 21:07:03,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-08 21:07:03,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:03,589 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:07:03,599 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-08 21:07:03,792 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-08 21:07:03,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:03,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:03,794 INFO L85 PathProgramCache]: Analyzing trace with hash -495393718, now seen corresponding path program 1 times [2024-11-08 21:07:03,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263214723] [2024-11-08 21:07:03,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:03,795 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-08 21:07:03,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:03,798 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-08 21:07:03,799 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-08 21:07:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:03,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 21:07:03,984 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:04,221 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-11-08 21:07:04,221 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 21:07:04,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:07:04,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263214723] [2024-11-08 21:07:04,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263214723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 21:07:04,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 21:07:04,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 21:07:04,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173054417] [2024-11-08 21:07:04,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 21:07:04,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 21:07:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:07:04,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 21:07:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 21:07:04,224 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:07:04,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:04,655 INFO L93 Difference]: Finished difference Result 214 states and 331 transitions. [2024-11-08 21:07:04,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 21:07:04,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 137 [2024-11-08 21:07:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:04,663 INFO L225 Difference]: With dead ends: 214 [2024-11-08 21:07:04,663 INFO L226 Difference]: Without dead ends: 144 [2024-11-08 21:07:04,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 21:07:04,665 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 71 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:04,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 372 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 21:07:04,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-08 21:07:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2024-11-08 21:07:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.3043478260869565) internal successors, (90), 69 states have internal predecessors, (90), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 21:07:04,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-11-08 21:07:04,693 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 137 [2024-11-08 21:07:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:04,698 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-11-08 21:07:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-08 21:07:04,698 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-11-08 21:07:04,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 21:07:04,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:04,700 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:07:04,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-08 21:07:04,903 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-08 21:07:04,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:04,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -325491625, now seen corresponding path program 1 times [2024-11-08 21:07:04,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:04,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2052036615] [2024-11-08 21:07:04,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:04,908 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-08 21:07:04,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:04,911 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-08 21:07:04,912 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-08 21:07:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:05,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-08 21:07:05,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 21:07:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 399 proven. 27 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-08 21:07:05,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 21:07:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-08 21:07:05,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 21:07:05,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2052036615] [2024-11-08 21:07:05,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2052036615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 21:07:05,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 21:07:05,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2024-11-08 21:07:05,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768389219] [2024-11-08 21:07:05,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 21:07:05,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 21:07:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 21:07:05,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 21:07:05,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 21:07:05,436 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:07:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 21:07:06,220 INFO L93 Difference]: Finished difference Result 268 states and 399 transitions. [2024-11-08 21:07:06,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-08 21:07:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 138 [2024-11-08 21:07:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 21:07:06,223 INFO L225 Difference]: With dead ends: 268 [2024-11-08 21:07:06,223 INFO L226 Difference]: Without dead ends: 198 [2024-11-08 21:07:06,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2024-11-08 21:07:06,224 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 250 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 21:07:06,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 501 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 21:07:06,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-08 21:07:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 124. [2024-11-08 21:07:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.240506329113924) internal successors, (98), 79 states have internal predecessors, (98), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-08 21:07:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 178 transitions. [2024-11-08 21:07:06,257 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 178 transitions. Word has length 138 [2024-11-08 21:07:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 21:07:06,257 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 178 transitions. [2024-11-08 21:07:06,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.0) internal successors, (55), 11 states have internal predecessors, (55), 2 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-08 21:07:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 178 transitions. [2024-11-08 21:07:06,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-08 21:07:06,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 21:07:06,262 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 21:07:06,277 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-08 21:07:06,462 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-08 21:07:06,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 21:07:06,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 21:07:06,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1346559979, now seen corresponding path program 1 times [2024-11-08 21:07:06,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 21:07:06,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [179273695] [2024-11-08 21:07:06,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 21:07:06,464 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-08 21:07:06,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 21:07:06,467 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-08 21:07:06,468 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-08 21:07:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 21:07:06,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-08 21:07:06,621 INFO L278 TraceCheckSpWp]: Computing forward predicates...