./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-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.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 b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:08:05,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:08:05,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:08:05,966 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:08:05,968 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:08:06,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:08:06,008 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:08:06,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:08:06,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:08:06,011 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:08:06,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:08:06,012 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:08:06,013 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:08:06,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:08:06,015 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:08:06,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:08:06,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:08:06,016 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:08:06,017 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:08:06,018 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:08:06,018 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:08:06,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:08:06,021 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:08:06,021 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:08:06,022 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:08:06,022 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:08:06,022 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:08:06,022 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:08:06,022 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:08:06,023 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:08:06,023 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:08:06,024 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:08:06,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:06,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:08:06,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:08:06,026 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:08:06,026 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:08:06,026 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:08:06,027 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:08:06,027 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:08:06,027 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:08:06,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:08:06,028 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 -> b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 [2024-10-14 10:08:06,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:08:06,317 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:08:06,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:08:06,323 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:08:06,324 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:08:06,325 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-3.i [2024-10-14 10:08:07,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:08:08,044 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:08:08,046 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2024-10-14 10:08:08,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee49906a6/fcbe0a10504b4a2cac5c37c96ab5c74f/FLAG9f7c41c68 [2024-10-14 10:08:08,076 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ee49906a6/fcbe0a10504b4a2cac5c37c96ab5c74f [2024-10-14 10:08:08,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:08:08,080 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:08:08,082 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:08,082 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:08:08,088 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:08:08,089 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,090 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fd4207d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08, skipping insertion in model container [2024-10-14 10:08:08,090 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,121 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:08:08,290 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i[918,931] [2024-10-14 10:08:08,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:08,395 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:08:08,404 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i[918,931] [2024-10-14 10:08:08,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:08,453 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:08:08,453 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08 WrapperNode [2024-10-14 10:08:08,453 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:08,454 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:08,454 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:08:08,455 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:08:08,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,537 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 238 [2024-10-14 10:08:08,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:08,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:08:08,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:08:08,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:08:08,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,564 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,601 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:08:08,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:08:08,661 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:08:08,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:08:08,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:08:08,662 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (1/1) ... [2024-10-14 10:08:08,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:08,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:08,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:08:08,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:08:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:08:08,822 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:08:08,823 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:08:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:08:08,824 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:08:08,824 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:08:08,920 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:08:08,922 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:08:09,449 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 10:08:09,450 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:08:09,493 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:08:09,493 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:08:09,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:09 BoogieIcfgContainer [2024-10-14 10:08:09,494 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:08:09,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:08:09,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:08:09,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:08:09,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:08" (1/3) ... [2024-10-14 10:08:09,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6704a669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:09, skipping insertion in model container [2024-10-14 10:08:09,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:08" (2/3) ... [2024-10-14 10:08:09,502 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6704a669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:09, skipping insertion in model container [2024-10-14 10:08:09,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:09" (3/3) ... [2024-10-14 10:08:09,504 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2024-10-14 10:08:09,522 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:08:09,522 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:08:09,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:08:09,597 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;@2f94d744, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:08:09,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:08:09,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 75 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 10:08:09,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 10:08:09,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:09,617 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:09,620 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:09,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1442575464, now seen corresponding path program 1 times [2024-10-14 10:08:09,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:09,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712407008] [2024-10-14 10:08:09,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:09,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:09,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:10,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:10,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:10,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:10,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:10,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:10,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:10,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:10,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:10,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712407008] [2024-10-14 10:08:10,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712407008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:10,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:10,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:08:10,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603008996] [2024-10-14 10:08:10,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:10,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:08:10,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:08:10,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:08:10,169 INFO L87 Difference]: Start difference. First operand has 100 states, 74 states have (on average 1.5945945945945945) internal successors, (118), 75 states have internal predecessors, (118), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:10,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:10,227 INFO L93 Difference]: Finished difference Result 197 states and 349 transitions. [2024-10-14 10:08:10,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:08:10,233 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2024-10-14 10:08:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:10,243 INFO L225 Difference]: With dead ends: 197 [2024-10-14 10:08:10,244 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 10:08:10,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:08:10,255 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:10,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:08:10,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 10:08:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-10-14 10:08:10,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.5342465753424657) internal successors, (112), 73 states have internal predecessors, (112), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 10:08:10,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 158 transitions. [2024-10-14 10:08:10,309 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 158 transitions. Word has length 156 [2024-10-14 10:08:10,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:10,312 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 158 transitions. [2024-10-14 10:08:10,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:10,312 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 158 transitions. [2024-10-14 10:08:10,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 10:08:10,319 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:10,319 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:10,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:08:10,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:10,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:10,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1847071526, now seen corresponding path program 1 times [2024-10-14 10:08:10,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:10,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629445488] [2024-10-14 10:08:10,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:10,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:10,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:10,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:10,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:10,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:11,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:11,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:11,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629445488] [2024-10-14 10:08:11,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629445488] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:11,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:11,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:08:11,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823878502] [2024-10-14 10:08:11,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:11,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:08:11,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:11,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:08:11,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:08:11,045 INFO L87 Difference]: Start difference. First operand 98 states and 158 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:11,123 INFO L93 Difference]: Finished difference Result 197 states and 319 transitions. [2024-10-14 10:08:11,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:08:11,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-10-14 10:08:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:11,127 INFO L225 Difference]: With dead ends: 197 [2024-10-14 10:08:11,128 INFO L226 Difference]: Without dead ends: 100 [2024-10-14 10:08:11,130 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:08:11,132 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:11,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 447 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-14 10:08:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-14 10:08:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.52) internal successors, (114), 75 states have internal predecessors, (114), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 10:08:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 160 transitions. [2024-10-14 10:08:11,146 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 160 transitions. Word has length 156 [2024-10-14 10:08:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 160 transitions. [2024-10-14 10:08:11,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 160 transitions. [2024-10-14 10:08:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 10:08:11,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:11,151 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:11,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:08:11,152 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:11,153 INFO L85 PathProgramCache]: Analyzing trace with hash -158127784, now seen corresponding path program 1 times [2024-10-14 10:08:11,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:11,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799231420] [2024-10-14 10:08:11,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:11,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:11,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:11,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:11,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:11,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:11,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:11,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:11,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,567 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:11,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:11,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799231420] [2024-10-14 10:08:11,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799231420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:11,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:11,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:08:11,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51810542] [2024-10-14 10:08:11,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:11,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:08:11,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:11,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:08:11,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:11,570 INFO L87 Difference]: Start difference. First operand 100 states and 160 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:11,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:11,656 INFO L93 Difference]: Finished difference Result 298 states and 478 transitions. [2024-10-14 10:08:11,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:08:11,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2024-10-14 10:08:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:11,660 INFO L225 Difference]: With dead ends: 298 [2024-10-14 10:08:11,660 INFO L226 Difference]: Without dead ends: 199 [2024-10-14 10:08:11,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:11,663 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 112 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:11,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 278 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:11,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-10-14 10:08:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2024-10-14 10:08:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 148 states have (on average 1.4864864864864864) internal successors, (220), 148 states have internal predecessors, (220), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-14 10:08:11,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 312 transitions. [2024-10-14 10:08:11,699 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 312 transitions. Word has length 156 [2024-10-14 10:08:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:11,703 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 312 transitions. [2024-10-14 10:08:11,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:11,703 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 312 transitions. [2024-10-14 10:08:11,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:08:11,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:11,706 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:11,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 10:08:11,709 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:11,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash 418975515, now seen corresponding path program 1 times [2024-10-14 10:08:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831253123] [2024-10-14 10:08:11,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:11,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:11,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:11,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:11,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:11,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:11,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:11,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:11,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:11,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:11,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:11,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:11,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:11,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:11,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831253123] [2024-10-14 10:08:11,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831253123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:11,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:11,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:08:11,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000329593] [2024-10-14 10:08:11,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:11,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:08:11,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:11,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:08:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:11,936 INFO L87 Difference]: Start difference. First operand 197 states and 312 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:12,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:12,120 INFO L93 Difference]: Finished difference Result 577 states and 919 transitions. [2024-10-14 10:08:12,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:08:12,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-10-14 10:08:12,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:12,127 INFO L225 Difference]: With dead ends: 577 [2024-10-14 10:08:12,127 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 10:08:12,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:12,129 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 139 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:12,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 363 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 10:08:12,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2024-10-14 10:08:12,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 282 states have (on average 1.4716312056737588) internal successors, (415), 282 states have internal predecessors, (415), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-14 10:08:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 599 transitions. [2024-10-14 10:08:12,206 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 599 transitions. Word has length 158 [2024-10-14 10:08:12,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:12,207 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 599 transitions. [2024-10-14 10:08:12,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 599 transitions. [2024-10-14 10:08:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-14 10:08:12,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:12,211 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:12,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 10:08:12,211 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:12,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:12,212 INFO L85 PathProgramCache]: Analyzing trace with hash -445704575, now seen corresponding path program 1 times [2024-10-14 10:08:12,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:12,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696217975] [2024-10-14 10:08:12,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:12,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:12,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:12,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:12,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:12,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:12,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:12,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:12,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:12,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:12,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:12,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696217975] [2024-10-14 10:08:12,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696217975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:12,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:12,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:08:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694873038] [2024-10-14 10:08:12,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:08:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:12,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:08:12,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:12,396 INFO L87 Difference]: Start difference. First operand 379 states and 599 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:12,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:12,463 INFO L93 Difference]: Finished difference Result 871 states and 1370 transitions. [2024-10-14 10:08:12,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:08:12,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2024-10-14 10:08:12,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:12,469 INFO L225 Difference]: With dead ends: 871 [2024-10-14 10:08:12,470 INFO L226 Difference]: Without dead ends: 493 [2024-10-14 10:08:12,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:12,473 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:12,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 322 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:08:12,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-10-14 10:08:12,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 419. [2024-10-14 10:08:12,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 322 states have (on average 1.4627329192546583) internal successors, (471), 322 states have internal predecessors, (471), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 92 states have call predecessors, (92), 92 states have call successors, (92) [2024-10-14 10:08:12,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 655 transitions. [2024-10-14 10:08:12,525 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 655 transitions. Word has length 158 [2024-10-14 10:08:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 655 transitions. [2024-10-14 10:08:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:12,528 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 655 transitions. [2024-10-14 10:08:12,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 10:08:12,530 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:12,530 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:12,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 10:08:12,531 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:12,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:12,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1369343948, now seen corresponding path program 1 times [2024-10-14 10:08:12,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:12,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390849229] [2024-10-14 10:08:12,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:12,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:12,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:12,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:12,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:12,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:12,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:12,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:12,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390849229] [2024-10-14 10:08:12,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390849229] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:12,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:08:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143559374] [2024-10-14 10:08:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:12,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 10:08:12,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:12,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 10:08:12,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:12,845 INFO L87 Difference]: Start difference. First operand 419 states and 655 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:12,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:12,977 INFO L93 Difference]: Finished difference Result 1053 states and 1648 transitions. [2024-10-14 10:08:12,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 10:08:12,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2024-10-14 10:08:12,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:12,983 INFO L225 Difference]: With dead ends: 1053 [2024-10-14 10:08:12,983 INFO L226 Difference]: Without dead ends: 635 [2024-10-14 10:08:12,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 10:08:12,986 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 114 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:12,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 299 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:08:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-14 10:08:13,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2024-10-14 10:08:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 488 states have (on average 1.4569672131147542) internal successors, (711), 488 states have internal predecessors, (711), 138 states have call successors, (138), 6 states have call predecessors, (138), 6 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2024-10-14 10:08:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 987 transitions. [2024-10-14 10:08:13,045 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 987 transitions. Word has length 159 [2024-10-14 10:08:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:13,046 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 987 transitions. [2024-10-14 10:08:13,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:13,046 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 987 transitions. [2024-10-14 10:08:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 10:08:13,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:13,048 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 10:08:13,049 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:13,050 INFO L85 PathProgramCache]: Analyzing trace with hash -132359249, now seen corresponding path program 1 times [2024-10-14 10:08:13,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:13,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559310361] [2024-10-14 10:08:13,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:13,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:14,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:14,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:14,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559310361] [2024-10-14 10:08:14,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559310361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:14,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:14,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:08:14,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107334921] [2024-10-14 10:08:14,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:14,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:14,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:14,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:14,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:14,066 INFO L87 Difference]: Start difference. First operand 633 states and 987 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:14,698 INFO L93 Difference]: Finished difference Result 1713 states and 2633 transitions. [2024-10-14 10:08:14,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:08:14,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 161 [2024-10-14 10:08:14,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:14,707 INFO L225 Difference]: With dead ends: 1713 [2024-10-14 10:08:14,707 INFO L226 Difference]: Without dead ends: 1295 [2024-10-14 10:08:14,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-10-14 10:08:14,710 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 271 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:14,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 385 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:08:14,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2024-10-14 10:08:14,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1099. [2024-10-14 10:08:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 912 states have (on average 1.4890350877192982) internal successors, (1358), 918 states have internal predecessors, (1358), 174 states have call successors, (174), 12 states have call predecessors, (174), 12 states have return successors, (174), 168 states have call predecessors, (174), 174 states have call successors, (174) [2024-10-14 10:08:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1706 transitions. [2024-10-14 10:08:14,814 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1706 transitions. Word has length 161 [2024-10-14 10:08:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:14,815 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1706 transitions. [2024-10-14 10:08:14,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1706 transitions. [2024-10-14 10:08:14,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-10-14 10:08:14,817 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:14,818 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:14,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 10:08:14,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:14,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:14,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1474042501, now seen corresponding path program 1 times [2024-10-14 10:08:14,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:14,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305772401] [2024-10-14 10:08:14,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:14,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:15,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:15,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:15,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:15,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:15,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:15,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305772401] [2024-10-14 10:08:15,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305772401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:15,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:15,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:08:15,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015034117] [2024-10-14 10:08:15,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:15,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:08:15,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:15,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:08:15,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:08:15,338 INFO L87 Difference]: Start difference. First operand 1099 states and 1706 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:16,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:16,173 INFO L93 Difference]: Finished difference Result 3215 states and 4942 transitions. [2024-10-14 10:08:16,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 10:08:16,174 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 161 [2024-10-14 10:08:16,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:16,189 INFO L225 Difference]: With dead ends: 3215 [2024-10-14 10:08:16,190 INFO L226 Difference]: Without dead ends: 2665 [2024-10-14 10:08:16,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:08:16,193 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 315 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:16,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 636 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:08:16,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2665 states. [2024-10-14 10:08:16,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2665 to 2619. [2024-10-14 10:08:16,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2619 states, 2210 states have (on average 1.4850678733031675) internal successors, (3282), 2234 states have internal predecessors, (3282), 372 states have call successors, (372), 36 states have call predecessors, (372), 36 states have return successors, (372), 348 states have call predecessors, (372), 372 states have call successors, (372) [2024-10-14 10:08:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2619 states to 2619 states and 4026 transitions. [2024-10-14 10:08:16,420 INFO L78 Accepts]: Start accepts. Automaton has 2619 states and 4026 transitions. Word has length 161 [2024-10-14 10:08:16,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:16,420 INFO L471 AbstractCegarLoop]: Abstraction has 2619 states and 4026 transitions. [2024-10-14 10:08:16,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:16,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2619 states and 4026 transitions. [2024-10-14 10:08:16,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:16,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:16,424 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:16,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 10:08:16,424 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -308726731, now seen corresponding path program 1 times [2024-10-14 10:08:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408725434] [2024-10-14 10:08:16,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:16,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:16,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:16,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:16,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408725434] [2024-10-14 10:08:16,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408725434] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:16,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:16,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 10:08:16,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794140096] [2024-10-14 10:08:16,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:16,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 10:08:16,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:16,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 10:08:16,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 10:08:16,885 INFO L87 Difference]: Start difference. First operand 2619 states and 4026 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:17,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:17,915 INFO L93 Difference]: Finished difference Result 5631 states and 8656 transitions. [2024-10-14 10:08:17,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 10:08:17,915 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-10-14 10:08:17,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:17,935 INFO L225 Difference]: With dead ends: 5631 [2024-10-14 10:08:17,936 INFO L226 Difference]: Without dead ends: 3013 [2024-10-14 10:08:17,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2024-10-14 10:08:17,947 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 502 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:17,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 824 Invalid, 648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:08:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3013 states. [2024-10-14 10:08:18,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3013 to 2981. [2024-10-14 10:08:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2981 states, 2510 states have (on average 1.4800796812749004) internal successors, (3715), 2536 states have internal predecessors, (3715), 430 states have call successors, (430), 40 states have call predecessors, (430), 40 states have return successors, (430), 404 states have call predecessors, (430), 430 states have call successors, (430) [2024-10-14 10:08:18,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2981 states to 2981 states and 4575 transitions. [2024-10-14 10:08:18,224 INFO L78 Accepts]: Start accepts. Automaton has 2981 states and 4575 transitions. Word has length 162 [2024-10-14 10:08:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:18,225 INFO L471 AbstractCegarLoop]: Abstraction has 2981 states and 4575 transitions. [2024-10-14 10:08:18,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:18,226 INFO L276 IsEmpty]: Start isEmpty. Operand 2981 states and 4575 transitions. [2024-10-14 10:08:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:18,229 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:18,230 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:18,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 10:08:18,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:18,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1014037289, now seen corresponding path program 1 times [2024-10-14 10:08:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:18,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961733111] [2024-10-14 10:08:18,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:19,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:19,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:19,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:19,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:19,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:19,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:19,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:19,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:19,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961733111] [2024-10-14 10:08:19,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961733111] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:19,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:19,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 10:08:19,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578858469] [2024-10-14 10:08:19,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:19,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 10:08:19,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 10:08:19,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:08:19,656 INFO L87 Difference]: Start difference. First operand 2981 states and 4575 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-14 10:08:20,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:20,836 INFO L93 Difference]: Finished difference Result 8309 states and 12635 transitions. [2024-10-14 10:08:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:08:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) Word has length 162 [2024-10-14 10:08:20,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:20,865 INFO L225 Difference]: With dead ends: 8309 [2024-10-14 10:08:20,865 INFO L226 Difference]: Without dead ends: 5329 [2024-10-14 10:08:20,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-10-14 10:08:20,876 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 646 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 646 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:20,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [646 Valid, 427 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 10:08:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5329 states. [2024-10-14 10:08:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5329 to 3585. [2024-10-14 10:08:21,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3585 states, 3090 states have (on average 1.4944983818770226) internal successors, (4618), 3119 states have internal predecessors, (4618), 448 states have call successors, (448), 46 states have call predecessors, (448), 46 states have return successors, (448), 419 states have call predecessors, (448), 448 states have call successors, (448) [2024-10-14 10:08:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3585 states to 3585 states and 5514 transitions. [2024-10-14 10:08:21,210 INFO L78 Accepts]: Start accepts. Automaton has 3585 states and 5514 transitions. Word has length 162 [2024-10-14 10:08:21,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:21,210 INFO L471 AbstractCegarLoop]: Abstraction has 3585 states and 5514 transitions. [2024-10-14 10:08:21,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 4 states have call predecessors, (23), 4 states have call successors, (23) [2024-10-14 10:08:21,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3585 states and 5514 transitions. [2024-10-14 10:08:21,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:21,214 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:21,215 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:21,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 10:08:21,216 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:21,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:21,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1706875370, now seen corresponding path program 1 times [2024-10-14 10:08:21,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:21,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015759228] [2024-10-14 10:08:21,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:21,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:21,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:21,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:21,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:21,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:21,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:21,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015759228] [2024-10-14 10:08:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015759228] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:21,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 10:08:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819595720] [2024-10-14 10:08:21,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:21,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:08:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:21,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:08:21,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:08:21,624 INFO L87 Difference]: Start difference. First operand 3585 states and 5514 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:22,545 INFO L93 Difference]: Finished difference Result 5063 states and 7679 transitions. [2024-10-14 10:08:22,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 10:08:22,546 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 162 [2024-10-14 10:08:22,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:22,568 INFO L225 Difference]: With dead ends: 5063 [2024-10-14 10:08:22,568 INFO L226 Difference]: Without dead ends: 4423 [2024-10-14 10:08:22,574 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-14 10:08:22,574 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 239 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:22,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 429 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:08:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2024-10-14 10:08:22,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 4090. [2024-10-14 10:08:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4090 states, 3559 states have (on average 1.4889013767912336) internal successors, (5299), 3600 states have internal predecessors, (5299), 472 states have call successors, (472), 58 states have call predecessors, (472), 58 states have return successors, (472), 431 states have call predecessors, (472), 472 states have call successors, (472) [2024-10-14 10:08:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4090 states to 4090 states and 6243 transitions. [2024-10-14 10:08:22,978 INFO L78 Accepts]: Start accepts. Automaton has 4090 states and 6243 transitions. Word has length 162 [2024-10-14 10:08:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:22,979 INFO L471 AbstractCegarLoop]: Abstraction has 4090 states and 6243 transitions. [2024-10-14 10:08:22,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-14 10:08:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 4090 states and 6243 transitions. [2024-10-14 10:08:22,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:22,984 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:22,984 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:22,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 10:08:22,985 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:22,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:22,985 INFO L85 PathProgramCache]: Analyzing trace with hash -355704412, now seen corresponding path program 1 times [2024-10-14 10:08:22,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:22,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558615631] [2024-10-14 10:08:22,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:22,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:23,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:23,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:23,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:23,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:23,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:23,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:23,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:23,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:23,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:23,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558615631] [2024-10-14 10:08:23,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558615631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:23,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:08:23,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903295164] [2024-10-14 10:08:23,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:23,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:23,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:23,289 INFO L87 Difference]: Start difference. First operand 4090 states and 6243 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:24,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:24,019 INFO L93 Difference]: Finished difference Result 7171 states and 10973 transitions. [2024-10-14 10:08:24,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:08:24,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-10-14 10:08:24,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:24,051 INFO L225 Difference]: With dead ends: 7171 [2024-10-14 10:08:24,052 INFO L226 Difference]: Without dead ends: 5111 [2024-10-14 10:08:24,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 10:08:24,060 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 280 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:24,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 566 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:08:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2024-10-14 10:08:24,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 4473. [2024-10-14 10:08:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4473 states, 3942 states have (on average 1.4908675799086757) internal successors, (5877), 3983 states have internal predecessors, (5877), 472 states have call successors, (472), 58 states have call predecessors, (472), 58 states have return successors, (472), 431 states have call predecessors, (472), 472 states have call successors, (472) [2024-10-14 10:08:24,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4473 states to 4473 states and 6821 transitions. [2024-10-14 10:08:24,492 INFO L78 Accepts]: Start accepts. Automaton has 4473 states and 6821 transitions. Word has length 162 [2024-10-14 10:08:24,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:24,493 INFO L471 AbstractCegarLoop]: Abstraction has 4473 states and 6821 transitions. [2024-10-14 10:08:24,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 4473 states and 6821 transitions. [2024-10-14 10:08:24,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:24,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:24,505 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:24,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 10:08:24,505 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:24,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:24,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1197475550, now seen corresponding path program 1 times [2024-10-14 10:08:24,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:24,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220182161] [2024-10-14 10:08:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:24,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:24,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:24,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:24,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:24,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:24,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:24,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:24,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:08:24,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:24,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220182161] [2024-10-14 10:08:24,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220182161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:08:24,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:08:24,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 10:08:24,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789366977] [2024-10-14 10:08:24,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:08:24,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 10:08:24,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:24,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 10:08:24,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:24,835 INFO L87 Difference]: Start difference. First operand 4473 states and 6821 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:26,095 INFO L93 Difference]: Finished difference Result 11694 states and 17619 transitions. [2024-10-14 10:08:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 10:08:26,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 162 [2024-10-14 10:08:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:26,140 INFO L225 Difference]: With dead ends: 11694 [2024-10-14 10:08:26,141 INFO L226 Difference]: Without dead ends: 7239 [2024-10-14 10:08:26,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:08:26,156 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 215 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:26,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 851 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:08:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7239 states. [2024-10-14 10:08:26,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7239 to 5856. [2024-10-14 10:08:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5856 states, 5107 states have (on average 1.4713138829058154) internal successors, (7514), 5174 states have internal predecessors, (7514), 650 states have call successors, (650), 98 states have call predecessors, (650), 98 states have return successors, (650), 583 states have call predecessors, (650), 650 states have call successors, (650) [2024-10-14 10:08:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5856 states to 5856 states and 8814 transitions. [2024-10-14 10:08:26,801 INFO L78 Accepts]: Start accepts. Automaton has 5856 states and 8814 transitions. Word has length 162 [2024-10-14 10:08:26,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:26,802 INFO L471 AbstractCegarLoop]: Abstraction has 5856 states and 8814 transitions. [2024-10-14 10:08:26,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:08:26,803 INFO L276 IsEmpty]: Start isEmpty. Operand 5856 states and 8814 transitions. [2024-10-14 10:08:26,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 10:08:26,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:26,807 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:26,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 10:08:26,807 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:26,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:26,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1357701973, now seen corresponding path program 1 times [2024-10-14 10:08:26,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:26,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161690370] [2024-10-14 10:08:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:28,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:28,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:28,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:28,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:28,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:28,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:28,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:28,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:28,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:28,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:28,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:28,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:28,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:28,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:28,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,135 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 66 proven. 60 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2024-10-14 10:08:28,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161690370] [2024-10-14 10:08:28,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161690370] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:28,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2014286118] [2024-10-14 10:08:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:28,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:28,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:28,139 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:08:28,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:08:28,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:28,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-14 10:08:28,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:29,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 644 proven. 69 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2024-10-14 10:08:29,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:29,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 51 proven. 15 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 10:08:29,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2014286118] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:08:29,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:08:29,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 14, 8] total 26 [2024-10-14 10:08:29,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492125514] [2024-10-14 10:08:29,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:08:29,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 10:08:29,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:29,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 10:08:29,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-10-14 10:08:29,950 INFO L87 Difference]: Start difference. First operand 5856 states and 8814 transitions. Second operand has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 25 states have internal predecessors, (133), 8 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) [2024-10-14 10:08:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:36,553 INFO L93 Difference]: Finished difference Result 18019 states and 26391 transitions. [2024-10-14 10:08:36,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2024-10-14 10:08:36,554 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 25 states have internal predecessors, (133), 8 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) Word has length 162 [2024-10-14 10:08:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:36,597 INFO L225 Difference]: With dead ends: 18019 [2024-10-14 10:08:36,597 INFO L226 Difference]: Without dead ends: 12181 [2024-10-14 10:08:36,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 476 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2806, Invalid=9850, Unknown=0, NotChecked=0, Total=12656 [2024-10-14 10:08:36,617 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 3208 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 609 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3208 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 2553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 609 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:36,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3208 Valid, 1090 Invalid, 2553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [609 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-14 10:08:36,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12181 states. [2024-10-14 10:08:37,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12181 to 3504. [2024-10-14 10:08:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3504 states, 3001 states have (on average 1.4215261579473508) internal successors, (4266), 3030 states have internal predecessors, (4266), 390 states have call successors, (390), 112 states have call predecessors, (390), 112 states have return successors, (390), 361 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-14 10:08:37,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3504 states to 3504 states and 5046 transitions. [2024-10-14 10:08:37,127 INFO L78 Accepts]: Start accepts. Automaton has 3504 states and 5046 transitions. Word has length 162 [2024-10-14 10:08:37,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:37,128 INFO L471 AbstractCegarLoop]: Abstraction has 3504 states and 5046 transitions. [2024-10-14 10:08:37,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.115384615384615) internal successors, (133), 25 states have internal predecessors, (133), 8 states have call successors, (50), 4 states have call predecessors, (50), 7 states have return successors, (52), 8 states have call predecessors, (52), 8 states have call successors, (52) [2024-10-14 10:08:37,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3504 states and 5046 transitions. [2024-10-14 10:08:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 10:08:37,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:37,133 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:37,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 10:08:37,337 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,SelfDestructingSolverStorable13 [2024-10-14 10:08:37,338 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:37,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:37,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1870942195, now seen corresponding path program 1 times [2024-10-14 10:08:37,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:37,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324332003] [2024-10-14 10:08:37,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:37,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:37,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:08:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:08:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:08:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:08:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:08:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:08:37,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:08:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:08:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:08:37,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:08:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:08:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:08:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 10:08:37,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:08:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:08:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:08:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:08:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:08:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:08:37,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-14 10:08:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-14 10:08:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-14 10:08:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-14 10:08:37,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 10:08:37,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:08:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324332003] [2024-10-14 10:08:37,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324332003] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:37,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [865633903] [2024-10-14 10:08:37,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:37,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:37,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:37,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:08:37,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:08:37,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:08:37,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 10:08:37,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:08:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2024-10-14 10:08:38,036 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:08:38,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [865633903] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:08:38,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 10:08:38,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2024-10-14 10:08:38,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547144066] [2024-10-14 10:08:38,563 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 10:08:38,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 10:08:38,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:08:38,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 10:08:38,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 10:08:38,564 INFO L87 Difference]: Start difference. First operand 3504 states and 5046 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-14 10:08:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:08:39,342 INFO L93 Difference]: Finished difference Result 6715 states and 9576 transitions. [2024-10-14 10:08:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 10:08:39,343 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 163 [2024-10-14 10:08:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:08:39,357 INFO L225 Difference]: With dead ends: 6715 [2024-10-14 10:08:39,357 INFO L226 Difference]: Without dead ends: 3229 [2024-10-14 10:08:39,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-10-14 10:08:39,365 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 104 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 10:08:39,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 507 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 10:08:39,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3229 states. [2024-10-14 10:08:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3229 to 3126. [2024-10-14 10:08:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2623 states have (on average 1.3930613800991232) internal successors, (3654), 2652 states have internal predecessors, (3654), 390 states have call successors, (390), 112 states have call predecessors, (390), 112 states have return successors, (390), 361 states have call predecessors, (390), 390 states have call successors, (390) [2024-10-14 10:08:39,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4434 transitions. [2024-10-14 10:08:39,804 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4434 transitions. Word has length 163 [2024-10-14 10:08:39,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:08:39,804 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 4434 transitions. [2024-10-14 10:08:39,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-14 10:08:39,805 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4434 transitions. [2024-10-14 10:08:39,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 10:08:39,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:08:39,808 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:39,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 10:08:40,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 10:08:40,013 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:08:40,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:08:40,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1361469105, now seen corresponding path program 1 times [2024-10-14 10:08:40,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:08:40,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038056151] [2024-10-14 10:08:40,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:08:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:08:40,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2034858668] [2024-10-14 10:08:40,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:08:40,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:40,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:40,112 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:08:40,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 10:08:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:08:40,648 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:08:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:08:40,897 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:08:40,897 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:08:40,899 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:08:40,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 10:08:41,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:08:41,105 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:08:41,214 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:08:41,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:08:41 BoogieIcfgContainer [2024-10-14 10:08:41,217 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:08:41,217 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:08:41,217 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:08:41,217 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:08:41,218 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:09" (3/4) ... [2024-10-14 10:08:41,220 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:08:41,221 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:08:41,221 INFO L158 Benchmark]: Toolchain (without parser) took 33141.72ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 979.4MB). Free memory was 122.4MB in the beginning and 936.2MB in the end (delta: -813.8MB). Peak memory consumption was 168.2MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,222 INFO L158 Benchmark]: CDTParser took 0.57ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:08:41,222 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.41ms. Allocated memory is still 190.8MB. Free memory was 122.1MB in the beginning and 105.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,222 INFO L158 Benchmark]: Boogie Procedure Inliner took 84.09ms. Allocated memory is still 190.8MB. Free memory was 105.8MB in the beginning and 100.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,223 INFO L158 Benchmark]: Boogie Preprocessor took 120.69ms. Allocated memory is still 190.8MB. Free memory was 100.6MB in the beginning and 94.5MB in the end (delta: 6.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,223 INFO L158 Benchmark]: RCFGBuilder took 833.48ms. Allocated memory is still 190.8MB. Free memory was 94.5MB in the beginning and 127.1MB in the end (delta: -32.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,223 INFO L158 Benchmark]: TraceAbstraction took 31720.40ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 979.4MB). Free memory was 125.9MB in the beginning and 937.2MB in the end (delta: -811.4MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. [2024-10-14 10:08:41,224 INFO L158 Benchmark]: Witness Printer took 3.86ms. Allocated memory is still 1.2GB. Free memory is still 936.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:08:41,225 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.57ms. Allocated memory is still 109.1MB. Free memory was 75.3MB in the beginning and 75.2MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.41ms. Allocated memory is still 190.8MB. Free memory was 122.1MB in the beginning and 105.8MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 84.09ms. Allocated memory is still 190.8MB. Free memory was 105.8MB in the beginning and 100.6MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 120.69ms. Allocated memory is still 190.8MB. Free memory was 100.6MB in the beginning and 94.5MB in the end (delta: 6.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 833.48ms. Allocated memory is still 190.8MB. Free memory was 94.5MB in the beginning and 127.1MB in the end (delta: -32.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 31720.40ms. Allocated memory was 190.8MB in the beginning and 1.2GB in the end (delta: 979.4MB). Free memory was 125.9MB in the beginning and 937.2MB in the end (delta: -811.4MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. * Witness Printer took 3.86ms. Allocated memory is still 1.2GB. Free memory is still 936.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of bitwiseOr at line 126. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int var_1_24 = 5; [L38] signed short int var_1_28 = 256; [L39] signed long int var_1_30 = -4; [L40] double var_1_32 = 0.0; [L41] unsigned short int var_1_34 = 34858; [L42] unsigned short int var_1_35 = 41225; [L43] double var_1_37 = 63.63; [L44] signed char var_1_39 = 10; [L45] signed char var_1_40 = -25; [L46] signed char var_1_41 = 4; [L47] unsigned char var_1_42 = 50; [L48] unsigned long int last_1_var_1_10 = 256; [L49] unsigned char last_1_var_1_20 = 32; [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] CALL updateLastVariables() [L171] last_1_var_1_10 = var_1_10 [L172] last_1_var_1_20 = var_1_20 [L182] RET updateLastVariables() [L183] CALL updateVariables() [L134] var_1_3 = __VERIFIER_nondet_uchar() [L135] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L135] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L136] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=-32, var_1_6=256] [L137] var_1_5 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L138] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L139] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L139] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L140] var_1_13 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L141] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L142] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L142] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L143] var_1_14 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L144] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L145] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L145] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L146] var_1_15 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L147] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L148] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L148] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L149] var_1_16 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L150] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L151] var_1_21 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L152] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L153] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L153] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=64, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L154] var_1_22 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L155] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L156] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L156] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=34858, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L157] var_1_34 = __VERIFIER_nondet_ushort() [L158] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L158] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L159] CALL assume_abort_if_not(var_1_34 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L159] RET assume_abort_if_not(var_1_34 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=41225, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L160] var_1_35 = __VERIFIER_nondet_ushort() [L161] CALL assume_abort_if_not(var_1_35 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L161] RET assume_abort_if_not(var_1_35 >= 32767) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L162] CALL assume_abort_if_not(var_1_35 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L162] RET assume_abort_if_not(var_1_35 <= 65535) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-25, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L163] var_1_40 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L164] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L165] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L165] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=4, var_1_42=50, var_1_5=1, var_1_6=256] [L166] var_1_41 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_41 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L167] RET assume_abort_if_not(var_1_41 >= -63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L168] CALL assume_abort_if_not(var_1_41 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L168] RET assume_abort_if_not(var_1_41 <= 63) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=5, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L183] RET updateVariables() [L184] CALL step() [L53] COND FALSE !(var_1_20 >= ((((var_1_14) > (var_1_23)) ? (var_1_14) : (var_1_23)))) [L56] var_1_24 = (((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) + ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=256, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L58] var_1_28 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L59] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=-4, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L59] COND TRUE ((var_1_6 ^ var_1_20) % var_1_21) > -10 [L60] var_1_30 = ((((var_1_20) < 0 ) ? -(var_1_20) : (var_1_20))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L62] EXPR ((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=0, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L62] COND TRUE (~ var_1_5) <= (((((var_1_22) > (-16)) ? (var_1_22) : (-16))) & 16) [L63] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L71] EXPR var_1_35 & var_1_14 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L71] EXPR (var_1_35 & var_1_14) >> var_1_22 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=6363/100, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L71] COND TRUE var_1_20 >= ((var_1_35 & var_1_14) >> var_1_22) [L72] var_1_37 = ((((var_1_16) < (var_1_16)) ? (var_1_16) : (var_1_16))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=10, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L74] var_1_39 = (var_1_40 + ((((var_1_41) < 0 ) ? -(var_1_41) : (var_1_41)))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L75] COND FALSE !(var_1_22 > var_1_21) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L88] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L93] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-1, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L94] COND TRUE stepLocal_2 > last_1_var_1_10 [L95] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L97] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L98] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L102] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L103] COND FALSE !(stepLocal_1 || var_1_3) [L108] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L110] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L121] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L126] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L126] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L127] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L175-L176] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=-1, var_1_14=0, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=128, var_1_21=-128, var_1_22=256, var_1_23=64, var_1_24=96, var_1_28=32, var_1_30=32, var_1_32=2, var_1_34=32767, var_1_35=32767, var_1_37=2, var_1_39=0, var_1_3=0, var_1_40=-63, var_1_41=63, var_1_42=50, var_1_5=1, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.5s, OverallIterations: 16, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 15.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6195 SdHoareTripleChecker+Valid, 6.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6184 mSDsluCounter, 7579 SdHoareTripleChecker+Invalid, 5.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5136 mSDsCounter, 1152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4498 IncrementalHoareTripleChecker+Invalid, 5650 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1152 mSolverCounterUnsat, 2443 mSDtfsCounter, 4498 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1457 GetRequests, 1272 SyntacticMatches, 4 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4350 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5856occurred in iteration=13, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 13232 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 3051 NumberOfCodeBlocks, 3051 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2869 ConstructedInterpolants, 0 QuantifiedInterpolants, 12701 SizeOfPredicates, 8 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 27 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 18006/18216 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 10:08:41,295 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-3.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 b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:08:43,600 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:08:43,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:08:43,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:08:43,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:08:43,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:08:43,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:08:43,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:08:43,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:08:43,730 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:08:43,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:08:43,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:08:43,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:08:43,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:08:43,734 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:08:43,734 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:08:43,735 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:08:43,735 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:08:43,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:08:43,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:08:43,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:08:43,740 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:08:43,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:08:43,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:08:43,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:08:43,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:08:43,741 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:08:43,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:08:43,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:08:43,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:08:43,742 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:08:43,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:08:43,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:08:43,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:08:43,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:43,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:08:43,743 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:08:43,745 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:08:43,745 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:08:43,745 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:08:43,746 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:08:43,746 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:08:43,746 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:08:43,747 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:08:43,747 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:08:43,747 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 -> b5f13d1ca047dbcfba4c64156e69d4d1e7e5e0ff8273386d7bb193153d05b386 [2024-10-14 10:08:44,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:08:44,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:08:44,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:08:44,139 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:08:44,140 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:08:44,142 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-3.i [2024-10-14 10:08:45,741 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:08:45,984 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:08:45,985 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2024-10-14 10:08:46,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2900516e5/9d408197c0f84aa2b0f570abbeb03241/FLAGe5407237c [2024-10-14 10:08:46,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2900516e5/9d408197c0f84aa2b0f570abbeb03241 [2024-10-14 10:08:46,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:08:46,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:08:46,029 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:46,029 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:08:46,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:08:46,035 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,036 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3af9c950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46, skipping insertion in model container [2024-10-14 10:08:46,036 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:08:46,249 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i[918,931] [2024-10-14 10:08:46,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:46,367 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:08:46,382 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i[918,931] [2024-10-14 10:08:46,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:08:46,457 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:08:46,458 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46 WrapperNode [2024-10-14 10:08:46,458 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:08:46,459 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:46,459 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:08:46,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:08:46,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,481 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,523 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-10-14 10:08:46,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:08:46,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:08:46,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:08:46,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:08:46,539 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,566 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 10:08:46,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,566 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,583 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,588 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:08:46,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:08:46,599 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:08:46,599 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:08:46,600 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (1/1) ... [2024-10-14 10:08:46,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:08:46,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:08:46,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 10:08:46,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 10:08:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:08:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:08:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:08:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:08:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:08:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:08:46,769 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:08:46,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:09:03,351 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:09:03,351 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:09:03,425 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:09:03,425 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:09:03,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:09:03 BoogieIcfgContainer [2024-10-14 10:09:03,426 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:09:03,431 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:09:03,431 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:09:03,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:09:03,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:46" (1/3) ... [2024-10-14 10:09:03,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ad59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:09:03, skipping insertion in model container [2024-10-14 10:09:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:46" (2/3) ... [2024-10-14 10:09:03,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9ad59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:09:03, skipping insertion in model container [2024-10-14 10:09:03,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:09:03" (3/3) ... [2024-10-14 10:09:03,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-3.i [2024-10-14 10:09:03,456 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:09:03,457 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:09:03,536 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:09:03,548 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;@2c2d0db4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:09:03,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:09:03,555 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 52 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-14 10:09:03,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-10-14 10:09:03,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:09:03,573 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 10:09:03,574 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:09:03,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:09:03,580 INFO L85 PathProgramCache]: Analyzing trace with hash -507567690, now seen corresponding path program 1 times [2024-10-14 10:09:03,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:09:03,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1704881657] [2024-10-14 10:09:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:09:03,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 10:09:03,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:09:03,601 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 10:09:03,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 10:09:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:09:04,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 10:09:04,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:09:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-14 10:09:08,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:09:08,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:09:08,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1704881657] [2024-10-14 10:09:08,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1704881657] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:09:08,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:09:08,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 10:09:08,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270503323] [2024-10-14 10:09:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:09:08,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:09:08,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:09:08,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:09:08,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:09:08,949 INFO L87 Difference]: Start difference. First operand has 77 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 52 states have internal predecessors, (80), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-14 10:09:13,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 10:09:17,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers []