./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:14:54,379 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:14:54,458 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 05:14:54,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:14:54,464 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:14:54,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:14:54,498 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:14:54,498 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:14:54,499 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:14:54,500 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:14:54,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:14:54,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:14:54,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:14:54,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:14:54,503 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:14:54,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:14:54,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:14:54,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:14:54,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 05:14:54,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:14:54,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:14:54,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:14:54,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:14:54,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:14:54,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:14:54,512 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:14:54,512 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:14:54,512 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:14:54,513 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:14:54,513 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:14:54,513 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:14:54,514 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:14:54,514 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:14:54,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:14:54,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:14:54,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:14:54,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 05:14:54,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 05:14:54,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:14:54,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:14:54,524 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:14:54,525 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:14:54,526 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 -> c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf [2024-11-20 05:14:54,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:14:54,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:14:54,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:14:54,810 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:14:54,810 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:14:54,811 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:14:56,329 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:14:56,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:14:56,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:14:56,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c42a580/45174b959f784bf393f89eedc5c8b0dd/FLAG32dd40378 [2024-11-20 05:14:56,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2c42a580/45174b959f784bf393f89eedc5c8b0dd [2024-11-20 05:14:56,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:14:56,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:14:56,588 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:14:56,588 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:14:56,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:14:56,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:56,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77d1f187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56, skipping insertion in model container [2024-11-20 05:14:56,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:56,626 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:14:56,781 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-ps-ci_file-97.i[919,932] [2024-11-20 05:14:56,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:14:56,870 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:14:56,879 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-ps-ci_file-97.i[919,932] [2024-11-20 05:14:56,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:14:56,930 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:14:56,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56 WrapperNode [2024-11-20 05:14:56,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:14:56,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:14:56,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:14:56,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:14:56,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:56,952 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,012 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 252 [2024-11-20 05:14:57,013 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:14:57,014 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:14:57,014 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:14:57,014 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:14:57,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,039 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,067 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:14:57,067 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,082 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,106 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:14:57,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:14:57,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:14:57,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:14:57,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (1/1) ... [2024-11-20 05:14:57,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:14:57,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:14:57,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:14:57,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:14:57,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:14:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:14:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:14:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 05:14:57,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:14:57,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:14:57,292 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:14:57,297 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:14:57,788 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-20 05:14:57,789 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:14:57,806 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:14:57,806 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:14:57,807 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:14:57 BoogieIcfgContainer [2024-11-20 05:14:57,807 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:14:57,809 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:14:57,809 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:14:57,812 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:14:57,813 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:14:56" (1/3) ... [2024-11-20 05:14:57,814 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33fbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:14:57, skipping insertion in model container [2024-11-20 05:14:57,814 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:14:56" (2/3) ... [2024-11-20 05:14:57,815 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d33fbfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:14:57, skipping insertion in model container [2024-11-20 05:14:57,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:14:57" (3/3) ... [2024-11-20 05:14:57,816 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:14:57,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:14:57,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:14:57,931 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:14:57,938 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;@b41c2d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:14:57,939 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:14:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 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-20 05:14:57,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 05:14:57,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:14:57,962 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] [2024-11-20 05:14:57,963 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:14:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:14:57,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1183361948, now seen corresponding path program 1 times [2024-11-20 05:14:58,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:14:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310115415] [2024-11-20 05:14:58,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:14:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:14:58,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:14:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:14:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:14:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:14:58,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:14:58,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:14:58,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:14:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:14:58,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:14:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:14:58,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:14:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:14:58,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:14:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:14:58,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:14:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:14:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:14:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:14:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:14:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:14:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,500 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-20 05:14:58,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:14:58,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310115415] [2024-11-20 05:14:58,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310115415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:14:58,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:14:58,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:14:58,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382467581] [2024-11-20 05:14:58,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:14:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:14:58,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:14:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:14:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:14:58,537 INFO L87 Difference]: Start difference. First operand has 106 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 84 states have internal predecessors, (126), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-20 05:14:58,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:14:58,570 INFO L93 Difference]: Finished difference Result 205 states and 346 transitions. [2024-11-20 05:14:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:14:58,573 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 140 [2024-11-20 05:14:58,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:14:58,584 INFO L225 Difference]: With dead ends: 205 [2024-11-20 05:14:58,584 INFO L226 Difference]: Without dead ends: 102 [2024-11-20 05:14:58,590 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-20 05:14:58,595 INFO L432 NwaCegarLoop]: 156 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, 156 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:14:58,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:14:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-20 05:14:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-11-20 05:14:58,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.45) internal successors, (116), 80 states have internal predecessors, (116), 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-20 05:14:58,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 156 transitions. [2024-11-20 05:14:58,645 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 156 transitions. Word has length 140 [2024-11-20 05:14:58,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:14:58,646 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 156 transitions. [2024-11-20 05:14:58,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-20 05:14:58,646 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 156 transitions. [2024-11-20 05:14:58,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 05:14:58,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:14:58,650 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] [2024-11-20 05:14:58,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 05:14:58,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:14:58,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:14:58,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1120654700, now seen corresponding path program 1 times [2024-11-20 05:14:58,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:14:58,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390854463] [2024-11-20 05:14:58,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:14:58,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:14:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:14:58,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:14:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:14:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:14:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:14:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:14:58,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:14:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:14:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:14:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:14:58,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:14:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:14:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:14:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:14:58,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:14:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:14:58,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:14:58,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:14:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:14:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:14:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:58,972 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-20 05:14:58,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:14:58,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390854463] [2024-11-20 05:14:58,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390854463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:14:58,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:14:58,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:14:58,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843314228] [2024-11-20 05:14:58,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:14:58,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:14:58,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:14:58,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:14:58,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:14:58,981 INFO L87 Difference]: Start difference. First operand 102 states and 156 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-20 05:14:59,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:14:59,094 INFO L93 Difference]: Finished difference Result 286 states and 439 transitions. [2024-11-20 05:14:59,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:14:59,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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 140 [2024-11-20 05:14:59,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:14:59,097 INFO L225 Difference]: With dead ends: 286 [2024-11-20 05:14:59,101 INFO L226 Difference]: Without dead ends: 187 [2024-11-20 05:14:59,102 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:14:59,103 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 139 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:14:59,104 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 360 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:14:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-20 05:14:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 170. [2024-11-20 05:14:59,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 127 states have (on average 1.3700787401574803) internal successors, (174), 127 states have internal predecessors, (174), 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-20 05:14:59,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 254 transitions. [2024-11-20 05:14:59,141 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 254 transitions. Word has length 140 [2024-11-20 05:14:59,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:14:59,142 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 254 transitions. [2024-11-20 05:14:59,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-20 05:14:59,142 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 254 transitions. [2024-11-20 05:14:59,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 05:14:59,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:14:59,145 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] [2024-11-20 05:14:59,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 05:14:59,146 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:14:59,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:14:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash -159208978, now seen corresponding path program 1 times [2024-11-20 05:14:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:14:59,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219813240] [2024-11-20 05:14:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:14:59,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:14:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:14:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:14:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:14:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:14:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:14:59,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:14:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:14:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:14:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:14:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:14:59,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:14:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:14:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:14:59,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:14:59,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:14:59,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:14:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:14:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:14:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:14:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:14:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:14:59,736 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-20 05:14:59,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:14:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219813240] [2024-11-20 05:14:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219813240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:14:59,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:14:59,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 05:14:59,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294512095] [2024-11-20 05:14:59,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:14:59,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:14:59,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:14:59,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:14:59,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:14:59,741 INFO L87 Difference]: Start difference. First operand 170 states and 254 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-20 05:14:59,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:14:59,802 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2024-11-20 05:14:59,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:14:59,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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 140 [2024-11-20 05:14:59,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:14:59,807 INFO L225 Difference]: With dead ends: 394 [2024-11-20 05:14:59,808 INFO L226 Difference]: Without dead ends: 227 [2024-11-20 05:14:59,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:14:59,814 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 51 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:14:59,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 290 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:14:59,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-20 05:14:59,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 212. [2024-11-20 05:14:59,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 148 states have (on average 1.3310810810810811) internal successors, (197), 148 states have internal predecessors, (197), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 05:14:59,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 317 transitions. [2024-11-20 05:14:59,849 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 317 transitions. Word has length 140 [2024-11-20 05:14:59,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:14:59,850 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 317 transitions. [2024-11-20 05:14:59,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (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-20 05:14:59,850 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 317 transitions. [2024-11-20 05:14:59,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-20 05:14:59,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:14:59,858 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] [2024-11-20 05:14:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 05:14:59,858 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:14:59,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:14:59,859 INFO L85 PathProgramCache]: Analyzing trace with hash 263492848, now seen corresponding path program 1 times [2024-11-20 05:14:59,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:14:59,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363881328] [2024-11-20 05:14:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:14:59,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:14:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:00,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:00,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:00,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:00,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:00,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:00,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:00,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:00,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:00,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:00,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:00,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:00,239 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-20 05:15:00,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:00,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363881328] [2024-11-20 05:15:00,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363881328] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:00,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:00,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:15:00,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888002377] [2024-11-20 05:15:00,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:00,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:15:00,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:00,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:15:00,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:00,245 INFO L87 Difference]: Start difference. First operand 212 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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-20 05:15:00,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:00,597 INFO L93 Difference]: Finished difference Result 555 states and 836 transitions. [2024-11-20 05:15:00,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:00,599 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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 140 [2024-11-20 05:15:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:00,603 INFO L225 Difference]: With dead ends: 555 [2024-11-20 05:15:00,605 INFO L226 Difference]: Without dead ends: 388 [2024-11-20 05:15:00,608 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:15:00,609 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 236 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:00,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 534 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:15:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-20 05:15:00,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 371. [2024-11-20 05:15:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 265 states have (on average 1.3396226415094339) internal successors, (355), 265 states have internal predecessors, (355), 100 states have call successors, (100), 5 states have call predecessors, (100), 5 states have return successors, (100), 100 states have call predecessors, (100), 100 states have call successors, (100) [2024-11-20 05:15:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 555 transitions. [2024-11-20 05:15:00,661 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 555 transitions. Word has length 140 [2024-11-20 05:15:00,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:00,664 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 555 transitions. [2024-11-20 05:15:00,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (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-20 05:15:00,665 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 555 transitions. [2024-11-20 05:15:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-20 05:15:00,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:00,667 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-20 05:15:00,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 05:15:00,667 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:00,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:00,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2115822692, now seen corresponding path program 1 times [2024-11-20 05:15:00,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:00,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40956354] [2024-11-20 05:15:00,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:00,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:01,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:01,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:01,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:01,245 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-20 05:15:01,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:01,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40956354] [2024-11-20 05:15:01,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40956354] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:01,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:01,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 05:15:01,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795029616] [2024-11-20 05:15:01,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:01,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 05:15:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:01,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 05:15:01,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:15:01,249 INFO L87 Difference]: Start difference. First operand 371 states and 555 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-20 05:15:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:01,718 INFO L93 Difference]: Finished difference Result 896 states and 1332 transitions. [2024-11-20 05:15:01,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:01,719 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-20 05:15:01,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:01,727 INFO L225 Difference]: With dead ends: 896 [2024-11-20 05:15:01,728 INFO L226 Difference]: Without dead ends: 570 [2024-11-20 05:15:01,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-20 05:15:01,730 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 252 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:01,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 658 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 05:15:01,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-11-20 05:15:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 540. [2024-11-20 05:15:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 392 states have (on average 1.316326530612245) internal successors, (516), 392 states have internal predecessors, (516), 140 states have call successors, (140), 7 states have call predecessors, (140), 7 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2024-11-20 05:15:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 796 transitions. [2024-11-20 05:15:01,786 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 796 transitions. Word has length 141 [2024-11-20 05:15:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:01,787 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 796 transitions. [2024-11-20 05:15:01,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 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-20 05:15:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 796 transitions. [2024-11-20 05:15:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 05:15:01,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:01,789 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-20 05:15:01,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 05:15:01,789 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:01,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:01,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1495744966, now seen corresponding path program 1 times [2024-11-20 05:15:01,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:01,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638177129] [2024-11-20 05:15:01,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:01,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:02,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:02,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,093 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-20 05:15:02,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:02,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638177129] [2024-11-20 05:15:02,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638177129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:02,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:02,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:15:02,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130086134] [2024-11-20 05:15:02,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:02,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:15:02,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:02,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:15:02,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:15:02,096 INFO L87 Difference]: Start difference. First operand 540 states and 796 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:02,256 INFO L93 Difference]: Finished difference Result 1141 states and 1706 transitions. [2024-11-20 05:15:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:02,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:02,263 INFO L225 Difference]: With dead ends: 1141 [2024-11-20 05:15:02,263 INFO L226 Difference]: Without dead ends: 646 [2024-11-20 05:15:02,265 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-20 05:15:02,266 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 301 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:02,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 483 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:15:02,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-20 05:15:02,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 600. [2024-11-20 05:15:02,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.3169642857142858) internal successors, (590), 452 states have internal predecessors, (590), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-20 05:15:02,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 874 transitions. [2024-11-20 05:15:02,325 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 874 transitions. Word has length 142 [2024-11-20 05:15:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:02,326 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 874 transitions. [2024-11-20 05:15:02,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 874 transitions. [2024-11-20 05:15:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 05:15:02,330 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:02,331 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-20 05:15:02,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 05:15:02,331 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:02,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -372113381, now seen corresponding path program 1 times [2024-11-20 05:15:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225875555] [2024-11-20 05:15:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:02,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:02,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:02,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:02,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:02,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:02,703 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-20 05:15:02,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:02,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225875555] [2024-11-20 05:15:02,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225875555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:02,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:02,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:15:02,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307944578] [2024-11-20 05:15:02,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:02,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 05:15:02,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:02,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 05:15:02,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 05:15:02,705 INFO L87 Difference]: Start difference. First operand 600 states and 874 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:02,821 INFO L93 Difference]: Finished difference Result 1193 states and 1746 transitions. [2024-11-20 05:15:02,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 05:15:02,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:02,828 INFO L225 Difference]: With dead ends: 1193 [2024-11-20 05:15:02,829 INFO L226 Difference]: Without dead ends: 637 [2024-11-20 05:15:02,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:02,834 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 129 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:02,834 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 568 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:15:02,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2024-11-20 05:15:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 600. [2024-11-20 05:15:02,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.296875) internal successors, (581), 452 states have internal predecessors, (581), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-20 05:15:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 865 transitions. [2024-11-20 05:15:02,921 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 865 transitions. Word has length 142 [2024-11-20 05:15:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:02,921 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 865 transitions. [2024-11-20 05:15:02,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 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-20 05:15:02,922 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 865 transitions. [2024-11-20 05:15:02,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 05:15:02,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:02,923 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, 1, 1, 1] [2024-11-20 05:15:02,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 05:15:02,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:02,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:02,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1661701271, now seen corresponding path program 1 times [2024-11-20 05:15:02,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:02,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523380272] [2024-11-20 05:15:02,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:02,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:03,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:03,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:03,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:03,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:03,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:03,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:03,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:03,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:03,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:03,177 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-20 05:15:03,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:03,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523380272] [2024-11-20 05:15:03,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523380272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:03,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:03,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 05:15:03,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968722924] [2024-11-20 05:15:03,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:03,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:15:03,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:03,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:15:03,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:03,180 INFO L87 Difference]: Start difference. First operand 600 states and 865 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-20 05:15:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:03,578 INFO L93 Difference]: Finished difference Result 915 states and 1333 transitions. [2024-11-20 05:15:03,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 05:15:03,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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 145 [2024-11-20 05:15:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:03,582 INFO L225 Difference]: With dead ends: 915 [2024-11-20 05:15:03,583 INFO L226 Difference]: Without dead ends: 675 [2024-11-20 05:15:03,584 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:15:03,585 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 252 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:03,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 850 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 05:15:03,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-20 05:15:03,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 600. [2024-11-20 05:15:03,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 448 states have (on average 1.2946428571428572) internal successors, (580), 452 states have internal predecessors, (580), 142 states have call successors, (142), 9 states have call predecessors, (142), 9 states have return successors, (142), 138 states have call predecessors, (142), 142 states have call successors, (142) [2024-11-20 05:15:03,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 864 transitions. [2024-11-20 05:15:03,667 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 864 transitions. Word has length 145 [2024-11-20 05:15:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:03,667 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 864 transitions. [2024-11-20 05:15:03,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 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-20 05:15:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 864 transitions. [2024-11-20 05:15:03,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 05:15:03,669 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:03,669 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, 1, 1, 1, 1] [2024-11-20 05:15:03,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 05:15:03,670 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:03,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:03,670 INFO L85 PathProgramCache]: Analyzing trace with hash 2077653650, now seen corresponding path program 1 times [2024-11-20 05:15:03,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:03,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443116866] [2024-11-20 05:15:03,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:03,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:03,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 05:15:10,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 05:15:10,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 05:15:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-20 05:15:10,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-20 05:15:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-20 05:15:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-20 05:15:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 05:15:10,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 05:15:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 05:15:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 05:15:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 05:15:10,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 05:15:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 05:15:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 05:15:10,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 05:15:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 05:15:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 05:15:10,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 05:15:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 05:15:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:10,098 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-20 05:15:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 05:15:10,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443116866] [2024-11-20 05:15:10,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443116866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:10,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:10,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 05:15:10,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338793582] [2024-11-20 05:15:10,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:10,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 05:15:10,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 05:15:10,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 05:15:10,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-20 05:15:10,101 INFO L87 Difference]: Start difference. First operand 600 states and 864 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-20 05:15:12,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:12,036 INFO L93 Difference]: Finished difference Result 1396 states and 1927 transitions. [2024-11-20 05:15:12,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:15:12,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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 146 [2024-11-20 05:15:12,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:12,045 INFO L225 Difference]: With dead ends: 1396 [2024-11-20 05:15:12,045 INFO L226 Difference]: Without dead ends: 1001 [2024-11-20 05:15:12,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-11-20 05:15:12,048 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 158 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:12,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 600 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 05:15:12,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2024-11-20 05:15:12,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 914. [2024-11-20 05:15:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 741 states have (on average 1.2645074224021593) internal successors, (937), 752 states have internal predecessors, (937), 156 states have call successors, (156), 16 states have call predecessors, (156), 16 states have return successors, (156), 145 states have call predecessors, (156), 156 states have call successors, (156) [2024-11-20 05:15:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1249 transitions. [2024-11-20 05:15:12,168 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1249 transitions. Word has length 146 [2024-11-20 05:15:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:12,170 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1249 transitions. [2024-11-20 05:15:12,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 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-20 05:15:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1249 transitions. [2024-11-20 05:15:12,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 05:15:12,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:12,173 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, 1, 1, 1, 1] [2024-11-20 05:15:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 05:15:12,173 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:12,174 INFO L85 PathProgramCache]: Analyzing trace with hash 272215316, now seen corresponding path program 1 times [2024-11-20 05:15:12,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 05:15:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432520762] [2024-11-20 05:15:12,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 05:15:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 05:15:12,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [760002914] [2024-11-20 05:15:12,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:12,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 05:15:12,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:15:12,251 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 05:15:12,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 05:15:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:15:12,456 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 05:15:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 05:15:12,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 05:15:12,622 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 05:15:12,623 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 05:15:12,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 05:15:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 05:15:12,832 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:15:12,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 05:15:12,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 05:15:12 BoogieIcfgContainer [2024-11-20 05:15:12,954 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 05:15:12,954 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 05:15:12,954 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 05:15:12,955 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 05:15:12,955 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:14:57" (3/4) ... [2024-11-20 05:15:12,957 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 05:15:12,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 05:15:12,959 INFO L158 Benchmark]: Toolchain (without parser) took 16372.46ms. Allocated memory was 182.5MB in the beginning and 381.7MB in the end (delta: 199.2MB). Free memory was 124.4MB in the beginning and 161.6MB in the end (delta: -37.2MB). Peak memory consumption was 164.3MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,959 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:15:12,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.19ms. Allocated memory is still 182.5MB. Free memory was 124.4MB in the beginning and 106.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,960 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.99ms. Allocated memory is still 182.5MB. Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,960 INFO L158 Benchmark]: Boogie Preprocessor took 92.65ms. Allocated memory is still 182.5MB. Free memory was 100.5MB in the beginning and 92.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,960 INFO L158 Benchmark]: RCFGBuilder took 699.45ms. Allocated memory is still 182.5MB. Free memory was 91.7MB in the beginning and 56.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,960 INFO L158 Benchmark]: TraceAbstraction took 15144.96ms. Allocated memory was 182.5MB in the beginning and 381.7MB in the end (delta: 199.2MB). Free memory was 55.2MB in the beginning and 162.6MB in the end (delta: -107.5MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. [2024-11-20 05:15:12,961 INFO L158 Benchmark]: Witness Printer took 4.28ms. Allocated memory is still 381.7MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 05:15:12,962 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 182.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.19ms. Allocated memory is still 182.5MB. Free memory was 124.4MB in the beginning and 106.8MB in the end (delta: 17.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.99ms. Allocated memory is still 182.5MB. Free memory was 106.8MB in the beginning and 100.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 92.65ms. Allocated memory is still 182.5MB. Free memory was 100.5MB in the beginning and 92.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 699.45ms. Allocated memory is still 182.5MB. Free memory was 91.7MB in the beginning and 56.0MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 15144.96ms. Allocated memory was 182.5MB in the beginning and 381.7MB in the end (delta: 199.2MB). Free memory was 55.2MB in the beginning and 162.6MB in the end (delta: -107.5MB). Peak memory consumption was 93.0MB. Max. memory is 16.1GB. * Witness Printer took 4.28ms. Allocated memory is still 381.7MB. Free memory is still 161.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 79. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed short int var_1_24 = -4; [L40] unsigned short int var_1_29 = 8; [L41] unsigned short int var_1_33 = 48416; [L42] unsigned char var_1_35 = 4; [L43] unsigned long int var_1_37 = 32; [L44] unsigned char var_1_38 = 8; [L45] double var_1_40 = 31.75; [L46] double var_1_41 = 5.5; [L47] signed char var_1_43 = 100; [L48] signed long int last_1_var_1_5 = 5; VAL [isInitial=0, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L178] isInitial = 1 [L179] FCALL initially() [L180] COND TRUE 1 [L181] CALL updateLastVariables() [L171] last_1_var_1_5 = var_1_5 VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0, var_1_9=643/5] [L181] RET updateLastVariables() [L182] CALL updateVariables() [L137] var_1_9 = __VERIFIER_nondet_float() [L138] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L138] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L139] var_1_10 = __VERIFIER_nondet_float() [L140] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L140] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L141] var_1_11 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L142] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L143] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L144] var_1_12 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L145] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L146] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L147] var_1_13 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L148] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L149] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L150] var_1_14 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L151] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L152] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L153] var_1_18 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L154] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L155] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L156] var_1_19 = __VERIFIER_nondet_char() [L157] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L157] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L158] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L159] var_1_23 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L160] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L161] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=48416, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L162] var_1_33 = __VERIFIER_nondet_ushort() [L163] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L163] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L164] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_40=127/4, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L165] var_1_40 = __VERIFIER_nondet_double() [L166] CALL assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L166] RET assume_abort_if_not((var_1_40 >= 0.0F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854776000e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_41=11/2, var_1_43=100, var_1_5=5, var_1_8=0] [L167] var_1_41 = __VERIFIER_nondet_double() [L168] CALL assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L168] RET assume_abort_if_not((var_1_41 >= 0.0F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854776000e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=-4, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L182] RET updateVariables() [L183] CALL step() [L52] COND FALSE !(\read(var_1_23)) [L57] var_1_24 = ((((var_1_11) < 0 ) ? -(var_1_11) : (var_1_11))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=8, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L59] COND FALSE !((var_1_20 / var_1_12) < var_1_11) [L62] var_1_29 = ((((((((((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) > (var_1_12)) ? (((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) : (var_1_12)))) > ((var_1_33 - var_1_11))) ? (((((((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) > (var_1_12)) ? (((((var_1_12) < (var_1_8)) ? (var_1_12) : (var_1_8)))) : (var_1_12)))) : ((var_1_33 - var_1_11)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L64] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=32, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L67] COND TRUE ((((var_1_8) < (var_1_12)) ? (var_1_8) : (var_1_12))) >= var_1_20 [L68] var_1_37 = var_1_8 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=8, var_1_43=100, var_1_5=5, var_1_8=0] [L70] COND FALSE !((var_1_9 * (var_1_40 - var_1_41)) >= var_1_9) [L77] var_1_38 = var_1_14 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=100, var_1_5=5, var_1_8=0] [L79] COND FALSE !(((((var_1_10) > (64.75f)) ? (var_1_10) : (64.75f))) <= var_1_40) [L86] var_1_43 = var_1_13 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L88] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L91] var_1_20 = var_1_8 [L92] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L93] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L96] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L97] COND FALSE !(\read(var_1_22)) [L104] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L106] unsigned long int stepLocal_1 = var_1_20 + var_1_15; [L107] signed long int stepLocal_0 = var_1_20; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_1=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L108] COND TRUE stepLocal_1 < -200 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L109] COND FALSE !(\read(var_1_22)) [L116] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L121] signed long int stepLocal_4 = 256; [L122] unsigned char stepLocal_3 = var_1_22; [L123] unsigned long int stepLocal_2 = var_1_15; VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, stepLocal_4=256, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L124] COND FALSE !(stepLocal_4 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, stepLocal_3=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=5, var_1_8=0] [L127] COND FALSE !(stepLocal_3 || var_1_22) [L132] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, stepLocal_0=0, stepLocal_2=0, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L183] RET step() [L184] CALL, EXPR property() [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174] EXPR (((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L174-L175] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L184] RET, EXPR property() [L184] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_5=5, var_1_11=-256, var_1_12=65, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_24=0, var_1_29=32767, var_1_33=32767, var_1_35=4, var_1_37=0, var_1_38=0, var_1_43=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.0s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1518 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1518 mSDsluCounter, 4499 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2684 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1157 IncrementalHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 1815 mSDtfsCounter, 1157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 439 GetRequests, 403 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=914occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 324 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1568 NumberOfCodeBlocks, 1568 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1267 ConstructedInterpolants, 0 QuantifiedInterpolants, 10669 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 6840/6840 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 05:15:13,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 05:15:15,236 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 05:15:15,312 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 05:15:15,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 05:15:15,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 05:15:15,354 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 05:15:15,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 05:15:15,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 05:15:15,356 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 05:15:15,356 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 05:15:15,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 05:15:15,357 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 05:15:15,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 05:15:15,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 05:15:15,358 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 05:15:15,358 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 05:15:15,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 05:15:15,359 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 05:15:15,359 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 05:15:15,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 05:15:15,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 05:15:15,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 05:15:15,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 05:15:15,364 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 05:15:15,364 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 05:15:15,365 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 05:15:15,365 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 05:15:15,365 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 05:15:15,365 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 05:15:15,366 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 05:15:15,366 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 05:15:15,366 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 05:15:15,366 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 05:15:15,367 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 05:15:15,367 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:15:15,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 05:15:15,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 05:15:15,367 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 05:15:15,368 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 05:15:15,368 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 05:15:15,368 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 05:15:15,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 05:15:15,369 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 05:15:15,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 05:15:15,370 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 -> c2b5d83791f5c517cc904865b76453ec006da14f7434583f731bc2f7adcccacf [2024-11-20 05:15:15,680 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 05:15:15,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 05:15:15,707 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 05:15:15,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 05:15:15,708 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 05:15:15,709 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:15:17,243 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 05:15:17,464 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 05:15:17,467 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:15:17,482 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b178d4e6/339e5c9c92d8480fa7429ec49de14591/FLAGb9e68ff4b [2024-11-20 05:15:17,511 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b178d4e6/339e5c9c92d8480fa7429ec49de14591 [2024-11-20 05:15:17,514 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 05:15:17,515 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 05:15:17,517 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 05:15:17,517 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 05:15:17,522 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 05:15:17,523 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:17,524 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e91638e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17, skipping insertion in model container [2024-11-20 05:15:17,524 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:17,557 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 05:15:17,766 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-ps-ci_file-97.i[919,932] [2024-11-20 05:15:17,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:15:17,884 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 05:15:17,896 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-ps-ci_file-97.i[919,932] [2024-11-20 05:15:17,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 05:15:17,972 INFO L204 MainTranslator]: Completed translation [2024-11-20 05:15:17,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17 WrapperNode [2024-11-20 05:15:17,973 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 05:15:17,974 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 05:15:17,974 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 05:15:17,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 05:15:17,980 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,000 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,036 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 169 [2024-11-20 05:15:18,037 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 05:15:18,037 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 05:15:18,037 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 05:15:18,038 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 05:15:18,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,081 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 05:15:18,081 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,081 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,094 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,103 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,112 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 05:15:18,113 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 05:15:18,113 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 05:15:18,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 05:15:18,114 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (1/1) ... [2024-11-20 05:15:18,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 05:15:18,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 05:15:18,145 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 05:15:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 05:15:18,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 05:15:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 05:15:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 05:15:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 05:15:18,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 05:15:18,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 05:15:18,259 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 05:15:18,262 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 05:15:26,919 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-20 05:15:26,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 05:15:26,933 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 05:15:26,934 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 05:15:26,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:26 BoogieIcfgContainer [2024-11-20 05:15:26,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 05:15:26,937 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 05:15:26,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 05:15:26,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 05:15:26,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:15:17" (1/3) ... [2024-11-20 05:15:26,941 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6533eb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:15:26, skipping insertion in model container [2024-11-20 05:15:26,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:15:17" (2/3) ... [2024-11-20 05:15:26,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6533eb26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:15:26, skipping insertion in model container [2024-11-20 05:15:26,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:15:26" (3/3) ... [2024-11-20 05:15:26,944 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-97.i [2024-11-20 05:15:26,959 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 05:15:26,959 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 05:15:27,033 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 05:15:27,041 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;@70ec157e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 05:15:27,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 05:15:27,047 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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-20 05:15:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 05:15:27,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:27,062 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:15:27,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:27,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:27,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1432092729, now seen corresponding path program 1 times [2024-11-20 05:15:27,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:27,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451181419] [2024-11-20 05:15:27,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:27,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:27,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:27,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:27,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 05:15:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:27,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 05:15:27,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:27,575 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-11-20 05:15:27,576 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:15:27,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:27,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451181419] [2024-11-20 05:15:27,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451181419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:27,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:27,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:15:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101073584] [2024-11-20 05:15:27,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:27,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 05:15:27,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:27,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 05:15:27,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:15:27,610 INFO L87 Difference]: Start difference. First operand has 75 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-20 05:15:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:27,634 INFO L93 Difference]: Finished difference Result 142 states and 246 transitions. [2024-11-20 05:15:27,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 05:15:27,637 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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 136 [2024-11-20 05:15:27,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:27,645 INFO L225 Difference]: With dead ends: 142 [2024-11-20 05:15:27,645 INFO L226 Difference]: Without dead ends: 70 [2024-11-20 05:15:27,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 05:15:27,655 INFO L432 NwaCegarLoop]: 105 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, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:27,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 05:15:27,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-20 05:15:27,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-20 05:15:27,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:15:27,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2024-11-20 05:15:27,694 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 136 [2024-11-20 05:15:27,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:27,695 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2024-11-20 05:15:27,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 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-20 05:15:27,695 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2024-11-20 05:15:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 05:15:27,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:27,698 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:15:27,715 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-20 05:15:27,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:27,900 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:27,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1997912767, now seen corresponding path program 1 times [2024-11-20 05:15:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:27,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784875891] [2024-11-20 05:15:27,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:27,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:27,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:27,907 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:27,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 05:15:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:28,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 05:15:28,263 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:29,430 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-20 05:15:29,430 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:15:29,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:29,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784875891] [2024-11-20 05:15:29,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1784875891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:29,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:29,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 05:15:29,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451468908] [2024-11-20 05:15:29,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:29,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 05:15:29,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 05:15:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:15:29,435 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:15:29,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:29,561 INFO L93 Difference]: Finished difference Result 201 states and 303 transitions. [2024-11-20 05:15:29,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 05:15:29,562 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-20 05:15:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:29,565 INFO L225 Difference]: With dead ends: 201 [2024-11-20 05:15:29,565 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 05:15:29,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 05:15:29,567 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 32 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:29,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 189 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 05:15:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 05:15:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 125. [2024-11-20 05:15:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 82 states have (on average 1.2926829268292683) internal successors, (106), 82 states have internal predecessors, (106), 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-20 05:15:29,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 186 transitions. [2024-11-20 05:15:29,600 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 186 transitions. Word has length 136 [2024-11-20 05:15:29,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:29,601 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 186 transitions. [2024-11-20 05:15:29,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:15:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 186 transitions. [2024-11-20 05:15:29,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 05:15:29,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:29,610 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:15:29,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 05:15:29,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:29,811 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:29,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash 708706627, now seen corresponding path program 1 times [2024-11-20 05:15:29,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:29,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129297317] [2024-11-20 05:15:29,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:29,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:29,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:29,816 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:29,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 05:15:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:30,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:15:30,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-11-20 05:15:30,633 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 05:15:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-20 05:15:31,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:31,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129297317] [2024-11-20 05:15:31,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1129297317] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 05:15:31,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 05:15:31,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 05:15:31,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231839749] [2024-11-20 05:15:31,292 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 05:15:31,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 05:15:31,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:31,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 05:15:31,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 05:15:31,294 INFO L87 Difference]: Start difference. First operand 125 states and 186 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 05:15:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:32,535 INFO L93 Difference]: Finished difference Result 197 states and 287 transitions. [2024-11-20 05:15:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 05:15:32,536 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 136 [2024-11-20 05:15:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:32,538 INFO L225 Difference]: With dead ends: 197 [2024-11-20 05:15:32,538 INFO L226 Difference]: Without dead ends: 75 [2024-11-20 05:15:32,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2024-11-20 05:15:32,540 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 102 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:32,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 149 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 05:15:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-20 05:15:32,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2024-11-20 05:15:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.2083333333333333) internal successors, (58), 48 states have internal predecessors, (58), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:15:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 98 transitions. [2024-11-20 05:15:32,554 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 98 transitions. Word has length 136 [2024-11-20 05:15:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:32,555 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 98 transitions. [2024-11-20 05:15:32,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-20 05:15:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 98 transitions. [2024-11-20 05:15:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 05:15:32,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:32,557 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 05:15:32,576 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-20 05:15:32,761 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-20 05:15:32,762 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1409771205, now seen corresponding path program 1 times [2024-11-20 05:15:32,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:32,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764654998] [2024-11-20 05:15:32,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:32,764 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:32,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:32,767 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-20 05:15:32,768 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-20 05:15:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:33,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 05:15:33,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:34,402 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-20 05:15:34,403 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:15:34,403 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:34,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764654998] [2024-11-20 05:15:34,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764654998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:34,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:34,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:15:34,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448042331] [2024-11-20 05:15:34,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:34,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:15:34,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:34,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:15:34,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:34,407 INFO L87 Difference]: Start difference. First operand 71 states and 98 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:15:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:35,231 INFO L93 Difference]: Finished difference Result 191 states and 268 transitions. [2024-11-20 05:15:35,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:35,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 136 [2024-11-20 05:15:35,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:35,234 INFO L225 Difference]: With dead ends: 191 [2024-11-20 05:15:35,234 INFO L226 Difference]: Without dead ends: 123 [2024-11-20 05:15:35,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 05:15:35,236 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 94 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:35,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 335 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 05:15:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-11-20 05:15:35,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 71. [2024-11-20 05:15:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.1875) internal successors, (57), 48 states have internal predecessors, (57), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-20 05:15:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2024-11-20 05:15:35,255 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 136 [2024-11-20 05:15:35,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:35,256 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2024-11-20 05:15:35,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-11-20 05:15:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2024-11-20 05:15:35,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 05:15:35,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:35,258 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-20 05:15:35,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 05:15:35,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:35,459 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:35,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1881339756, now seen corresponding path program 1 times [2024-11-20 05:15:35,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:35,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1373887862] [2024-11-20 05:15:35,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:35,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:35,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:35,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:35,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 05:15:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:35,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 05:15:35,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:39,595 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-20 05:15:39,595 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:15:39,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:39,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1373887862] [2024-11-20 05:15:39,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1373887862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:39,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:39,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:15:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734740134] [2024-11-20 05:15:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:39,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:15:39,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:39,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:15:39,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:39,598 INFO L87 Difference]: Start difference. First operand 71 states and 97 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-20 05:15:40,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:40,311 INFO L93 Difference]: Finished difference Result 214 states and 292 transitions. [2024-11-20 05:15:40,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:40,311 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-20 05:15:40,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:40,313 INFO L225 Difference]: With dead ends: 214 [2024-11-20 05:15:40,313 INFO L226 Difference]: Without dead ends: 146 [2024-11-20 05:15:40,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:15:40,315 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 66 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:40,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 300 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 05:15:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-20 05:15:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2024-11-20 05:15:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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-20 05:15:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2024-11-20 05:15:40,357 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 137 [2024-11-20 05:15:40,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:40,358 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2024-11-20 05:15:40,358 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-20 05:15:40,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2024-11-20 05:15:40,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-20 05:15:40,360 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:40,361 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-20 05:15:40,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-20 05:15:40,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:40,562 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:40,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:40,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1402510290, now seen corresponding path program 1 times [2024-11-20 05:15:40,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:40,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045039695] [2024-11-20 05:15:40,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:40,563 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:40,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:40,566 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:40,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 05:15:40,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:40,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 05:15:40,858 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 05:15:42,668 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-20 05:15:42,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 05:15:42,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 05:15:42,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045039695] [2024-11-20 05:15:42,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045039695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 05:15:42,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 05:15:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 05:15:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064713734] [2024-11-20 05:15:42,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 05:15:42,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 05:15:42,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 05:15:42,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 05:15:42,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 05:15:42,670 INFO L87 Difference]: Start difference. First operand 137 states and 189 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-20 05:15:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 05:15:43,264 INFO L93 Difference]: Finished difference Result 280 states and 384 transitions. [2024-11-20 05:15:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 05:15:43,265 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-20 05:15:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 05:15:43,267 INFO L225 Difference]: With dead ends: 280 [2024-11-20 05:15:43,267 INFO L226 Difference]: Without dead ends: 212 [2024-11-20 05:15:43,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 05:15:43,268 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 68 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-20 05:15:43,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-20 05:15:43,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-20 05:15:43,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 137. [2024-11-20 05:15:43,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 92 states have (on average 1.184782608695652) internal successors, (109), 92 states have internal predecessors, (109), 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-20 05:15:43,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 189 transitions. [2024-11-20 05:15:43,295 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 189 transitions. Word has length 137 [2024-11-20 05:15:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 05:15:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 189 transitions. [2024-11-20 05:15:43,295 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-20 05:15:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 189 transitions. [2024-11-20 05:15:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-20 05:15:43,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 05:15:43,297 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-20 05:15:43,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 05:15:43,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:43,498 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 05:15:43,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 05:15:43,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1752660796, now seen corresponding path program 1 times [2024-11-20 05:15:43,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 05:15:43,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353210345] [2024-11-20 05:15:43,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 05:15:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 05:15:43,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 05:15:43,505 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 05:15:43,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 05:15:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 05:15:43,785 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-20 05:15:43,789 INFO L278 TraceCheckSpWp]: Computing forward predicates...