./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_floatingpointinfluence_no-floats_file-43.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:02:52,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:02:52,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 06:02:52,081 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:02:52,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:02:52,096 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:02:52,097 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:02:52,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:02:52,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:02:52,098 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:02:52,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:02:52,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:02:52,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:02:52,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:02:52,099 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:02:52,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:02:52,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:02:52,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:02:52,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 06:02:52,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:02:52,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:02:52,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:02:52,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:02:52,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:02:52,102 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:02:52,103 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:02:52,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:02:52,103 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:02:52,103 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:02:52,104 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:02:52,104 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:02:52,104 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:02:52,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:02:52,105 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:02:52,105 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:02:52,105 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:02:52,105 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 06:02:52,105 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 06:02:52,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:02:52,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:02:52,106 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:02:52,106 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:02:52,106 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2024-11-20 06:02:52,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:02:52,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:02:52,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:02:52,328 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:02:52,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:02:52,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:02:53,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:02:53,781 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:02:53,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:02:53,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efeccea5f/911ad0982b784677820c86fedeb5eec9/FLAG4c1382291 [2024-11-20 06:02:54,188 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efeccea5f/911ad0982b784677820c86fedeb5eec9 [2024-11-20 06:02:54,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:02:54,193 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:02:54,194 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:02:54,194 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:02:54,200 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:02:54,201 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@224e8f82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54, skipping insertion in model container [2024-11-20 06:02:54,203 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:02:54,353 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2024-11-20 06:02:54,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:02:54,403 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:02:54,413 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2024-11-20 06:02:54,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:02:54,442 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:02:54,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54 WrapperNode [2024-11-20 06:02:54,442 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:02:54,443 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:02:54,443 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:02:54,443 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:02:54,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,488 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 184 [2024-11-20 06:02:54,489 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:02:54,489 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:02:54,489 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:02:54,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:02:54,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,508 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,522 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:02:54,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,523 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,539 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:02:54,546 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:02:54,546 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:02:54,560 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:02:54,562 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (1/1) ... [2024-11-20 06:02:54,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:02:54,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:02:54,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:02:54,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:02:54,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:02:54,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:02:54,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:02:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 06:02:54,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:02:54,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:02:54,703 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:02:54,704 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:02:54,919 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-20 06:02:54,919 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:02:54,929 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:02:54,929 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:02:54,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:54 BoogieIcfgContainer [2024-11-20 06:02:54,930 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:02:54,931 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:02:54,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:02:54,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:02:54,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:02:54" (1/3) ... [2024-11-20 06:02:54,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298d1103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:02:54, skipping insertion in model container [2024-11-20 06:02:54,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:02:54" (2/3) ... [2024-11-20 06:02:54,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298d1103 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:02:54, skipping insertion in model container [2024-11-20 06:02:54,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:54" (3/3) ... [2024-11-20 06:02:54,936 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:02:54,948 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:02:54,948 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:02:54,995 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:02:55,002 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;@2757bee0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:02:55,003 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:02:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:02:55,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 06:02:55,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:55,022 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:55,022 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:55,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:55,028 INFO L85 PathProgramCache]: Analyzing trace with hash -2072237394, now seen corresponding path program 1 times [2024-11-20 06:02:55,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:55,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383321548] [2024-11-20 06:02:55,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:55,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:55,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:55,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:55,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:55,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:55,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:55,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:55,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:55,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:02:55,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:55,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383321548] [2024-11-20 06:02:55,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383321548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:55,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:55,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:02:55,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688678593] [2024-11-20 06:02:55,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:55,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:02:55,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:55,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:02:55,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:02:55,460 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.3888888888888888) internal successors, (75), 55 states have internal predecessors, (75), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:02:55,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:55,527 INFO L93 Difference]: Finished difference Result 155 states and 264 transitions. [2024-11-20 06:02:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:02:55,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2024-11-20 06:02:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:55,538 INFO L225 Difference]: With dead ends: 155 [2024-11-20 06:02:55,538 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 06:02:55,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:02:55,547 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:55,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:02:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 06:02:55,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 06:02:55,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:02:55,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-20 06:02:55,582 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 153 [2024-11-20 06:02:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:55,582 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-20 06:02:55,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:02:55,583 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-20 06:02:55,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 06:02:55,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:55,586 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:55,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 06:02:55,586 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:55,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:55,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1480861010, now seen corresponding path program 1 times [2024-11-20 06:02:55,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:55,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-11-20 06:02:55,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:55,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:55,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:57,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:57,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:57,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:57,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:57,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:57,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:57,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:57,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:57,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:02:57,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:57,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770389034] [2024-11-20 06:02:57,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770389034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:57,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:57,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:02:57,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458594619] [2024-11-20 06:02:57,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:57,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:02:57,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:57,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:02:57,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:02:57,775 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:02:58,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:58,076 INFO L93 Difference]: Finished difference Result 193 states and 283 transitions. [2024-11-20 06:02:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 06:02:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-20 06:02:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:58,081 INFO L225 Difference]: With dead ends: 193 [2024-11-20 06:02:58,083 INFO L226 Difference]: Without dead ends: 119 [2024-11-20 06:02:58,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:02:58,084 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 79 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:58,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 413 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:02:58,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-20 06:02:58,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 80. [2024-11-20 06:02:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:02:58,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 119 transitions. [2024-11-20 06:02:58,101 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 119 transitions. Word has length 153 [2024-11-20 06:02:58,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:58,102 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 119 transitions. [2024-11-20 06:02:58,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:02:58,102 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 119 transitions. [2024-11-20 06:02:58,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-20 06:02:58,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:58,104 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:58,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 06:02:58,105 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:58,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:58,105 INFO L85 PathProgramCache]: Analyzing trace with hash -248710738, now seen corresponding path program 1 times [2024-11-20 06:02:58,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:58,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263425097] [2024-11-20 06:02:58,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:02:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:02:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:02:59,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:02:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:02:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:02:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:02:59,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:02:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:02:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:02:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:02:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:02:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:02:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:02:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:02:59,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:02:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:02:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:02:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:02:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:02:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:02:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:02:59,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:02:59,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:02:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:02:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:02:59,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:02:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263425097] [2024-11-20 06:02:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263425097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:02:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:02:59,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:02:59,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950483012] [2024-11-20 06:02:59,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:02:59,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:02:59,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:02:59,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:02:59,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:02:59,640 INFO L87 Difference]: Start difference. First operand 80 states and 119 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:02:59,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:02:59,835 INFO L93 Difference]: Finished difference Result 180 states and 263 transitions. [2024-11-20 06:02:59,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 06:02:59,836 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2024-11-20 06:02:59,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:02:59,837 INFO L225 Difference]: With dead ends: 180 [2024-11-20 06:02:59,837 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 06:02:59,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:02:59,839 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 53 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:02:59,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 415 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:02:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 06:02:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 77. [2024-11-20 06:02:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 51 states have internal predecessors, (67), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:02:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 115 transitions. [2024-11-20 06:02:59,857 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 115 transitions. Word has length 153 [2024-11-20 06:02:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:02:59,858 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 115 transitions. [2024-11-20 06:02:59,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:02:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 115 transitions. [2024-11-20 06:02:59,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-20 06:02:59,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:02:59,862 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:02:59,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 06:02:59,863 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:02:59,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:02:59,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2003628873, now seen corresponding path program 1 times [2024-11-20 06:02:59,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:02:59,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592675546] [2024-11-20 06:02:59,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:02:59,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:02:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:00,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:00,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:00,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:00,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:00,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:00,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:00,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:00,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592675546] [2024-11-20 06:03:00,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592675546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:00,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:00,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 06:03:00,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444662358] [2024-11-20 06:03:00,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:00,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:03:00,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:00,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:03:00,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:03:00,083 INFO L87 Difference]: Start difference. First operand 77 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:00,287 INFO L93 Difference]: Finished difference Result 201 states and 299 transitions. [2024-11-20 06:03:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:03:00,288 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 155 [2024-11-20 06:03:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:00,291 INFO L225 Difference]: With dead ends: 201 [2024-11-20 06:03:00,292 INFO L226 Difference]: Without dead ends: 127 [2024-11-20 06:03:00,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:03:00,294 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 65 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:00,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 583 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:03:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-20 06:03:00,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2024-11-20 06:03:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 87 states have (on average 1.3333333333333333) internal successors, (116), 88 states have internal predecessors, (116), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-20 06:03:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2024-11-20 06:03:00,312 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 155 [2024-11-20 06:03:00,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:00,313 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2024-11-20 06:03:00,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2024-11-20 06:03:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 06:03:00,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:00,315 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:00,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 06:03:00,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -38969816, now seen corresponding path program 1 times [2024-11-20 06:03:00,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:00,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818322991] [2024-11-20 06:03:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:00,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818322991] [2024-11-20 06:03:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818322991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:00,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 06:03:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629833143] [2024-11-20 06:03:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 06:03:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:00,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 06:03:00,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 06:03:00,618 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:00,691 INFO L93 Difference]: Finished difference Result 303 states and 450 transitions. [2024-11-20 06:03:00,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 06:03:00,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-11-20 06:03:00,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:00,696 INFO L225 Difference]: With dead ends: 303 [2024-11-20 06:03:00,697 INFO L226 Difference]: Without dead ends: 182 [2024-11-20 06:03:00,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 06:03:00,698 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 74 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:00,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 655 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:03:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-20 06:03:00,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2024-11-20 06:03:00,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 125 states have (on average 1.328) internal successors, (166), 127 states have internal predecessors, (166), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 06:03:00,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 266 transitions. [2024-11-20 06:03:00,714 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 266 transitions. Word has length 156 [2024-11-20 06:03:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:00,714 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 266 transitions. [2024-11-20 06:03:00,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,715 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 266 transitions. [2024-11-20 06:03:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 06:03:00,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:00,716 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 06:03:00,716 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:00,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 436989747, now seen corresponding path program 1 times [2024-11-20 06:03:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487862472] [2024-11-20 06:03:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:00,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:00,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:00,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:00,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:00,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:00,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:00,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:00,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:00,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:00,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487862472] [2024-11-20 06:03:00,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487862472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:00,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:00,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 06:03:00,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275880396] [2024-11-20 06:03:00,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:00,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 06:03:00,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:00,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 06:03:00,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:03:00,797 INFO L87 Difference]: Start difference. First operand 179 states and 266 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:00,825 INFO L93 Difference]: Finished difference Result 441 states and 648 transitions. [2024-11-20 06:03:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 06:03:00,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 156 [2024-11-20 06:03:00,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:00,828 INFO L225 Difference]: With dead ends: 441 [2024-11-20 06:03:00,828 INFO L226 Difference]: Without dead ends: 265 [2024-11-20 06:03:00,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 06:03:00,829 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 64 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:00,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 252 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:03:00,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-20 06:03:00,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 200. [2024-11-20 06:03:00,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 145 states have (on average 1.3310344827586207) internal successors, (193), 147 states have internal predecessors, (193), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 06:03:00,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 293 transitions. [2024-11-20 06:03:00,842 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 293 transitions. Word has length 156 [2024-11-20 06:03:00,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:00,843 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 293 transitions. [2024-11-20 06:03:00,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:00,843 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 293 transitions. [2024-11-20 06:03:00,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:03:00,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:00,844 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:00,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 06:03:00,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:00,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:00,845 INFO L85 PathProgramCache]: Analyzing trace with hash 222150276, now seen corresponding path program 1 times [2024-11-20 06:03:00,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:00,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665263115] [2024-11-20 06:03:00,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:00,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:02,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:02,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:02,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:02,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665263115] [2024-11-20 06:03:02,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665263115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:02,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:02,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:03:02,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655921514] [2024-11-20 06:03:02,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:02,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:03:02,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:02,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:03:02,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:03:02,561 INFO L87 Difference]: Start difference. First operand 200 states and 293 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:03,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:03,556 INFO L93 Difference]: Finished difference Result 680 states and 976 transitions. [2024-11-20 06:03:03,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 06:03:03,557 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-20 06:03:03,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:03,560 INFO L225 Difference]: With dead ends: 680 [2024-11-20 06:03:03,560 INFO L226 Difference]: Without dead ends: 483 [2024-11-20 06:03:03,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2024-11-20 06:03:03,561 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 425 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 833 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:03,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 833 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 06:03:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-11-20 06:03:03,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 395. [2024-11-20 06:03:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 291 states have (on average 1.309278350515464) internal successors, (381), 294 states have internal predecessors, (381), 94 states have call successors, (94), 9 states have call predecessors, (94), 9 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 06:03:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 569 transitions. [2024-11-20 06:03:03,602 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 569 transitions. Word has length 157 [2024-11-20 06:03:03,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:03,602 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 569 transitions. [2024-11-20 06:03:03,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 569 transitions. [2024-11-20 06:03:03,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:03:03,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:03,604 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:03,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 06:03:03,604 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:03,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:03,604 INFO L85 PathProgramCache]: Analyzing trace with hash -798918078, now seen corresponding path program 1 times [2024-11-20 06:03:03,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:03,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969818536] [2024-11-20 06:03:03,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:03,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:04,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:04,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:04,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:04,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969818536] [2024-11-20 06:03:04,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969818536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:04,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:04,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 06:03:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778951221] [2024-11-20 06:03:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:04,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 06:03:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 06:03:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:03:04,750 INFO L87 Difference]: Start difference. First operand 395 states and 569 transitions. Second operand has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:05,820 INFO L93 Difference]: Finished difference Result 515 states and 723 transitions. [2024-11-20 06:03:05,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 06:03:05,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-20 06:03:05,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:05,825 INFO L225 Difference]: With dead ends: 515 [2024-11-20 06:03:05,825 INFO L226 Difference]: Without dead ends: 513 [2024-11-20 06:03:05,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-20 06:03:05,828 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 248 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 1137 SdHoareTripleChecker+Invalid, 1068 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:05,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 1137 Invalid, 1068 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 06:03:05,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2024-11-20 06:03:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 419. [2024-11-20 06:03:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 303 states have (on average 1.297029702970297) internal successors, (393), 307 states have internal predecessors, (393), 104 states have call successors, (104), 11 states have call predecessors, (104), 11 states have return successors, (104), 100 states have call predecessors, (104), 104 states have call successors, (104) [2024-11-20 06:03:05,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 601 transitions. [2024-11-20 06:03:05,865 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 601 transitions. Word has length 157 [2024-11-20 06:03:05,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:05,866 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 601 transitions. [2024-11-20 06:03:05,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.076923076923077) internal successors, (40), 13 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:05,866 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 601 transitions. [2024-11-20 06:03:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:03:05,867 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:05,867 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:05,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 06:03:05,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:05,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:05,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1810035328, now seen corresponding path program 1 times [2024-11-20 06:03:05,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:05,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756913886] [2024-11-20 06:03:05,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:06,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:06,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:06,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:06,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:06,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:06,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:06,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:06,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:06,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:06,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756913886] [2024-11-20 06:03:06,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756913886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:06,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:06,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 06:03:06,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19074412] [2024-11-20 06:03:06,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:06,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 06:03:06,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:06,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 06:03:06,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-20 06:03:06,517 INFO L87 Difference]: Start difference. First operand 419 states and 601 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:07,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:07,320 INFO L93 Difference]: Finished difference Result 1066 states and 1496 transitions. [2024-11-20 06:03:07,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 06:03:07,321 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-20 06:03:07,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:07,327 INFO L225 Difference]: With dead ends: 1066 [2024-11-20 06:03:07,328 INFO L226 Difference]: Without dead ends: 869 [2024-11-20 06:03:07,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:03:07,330 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 272 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1170 SdHoareTripleChecker+Invalid, 887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:07,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1170 Invalid, 887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 06:03:07,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2024-11-20 06:03:07,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 629. [2024-11-20 06:03:07,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 475 states have (on average 1.2589473684210526) internal successors, (598), 481 states have internal predecessors, (598), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-20 06:03:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 870 transitions. [2024-11-20 06:03:07,389 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 870 transitions. Word has length 157 [2024-11-20 06:03:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:07,389 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 870 transitions. [2024-11-20 06:03:07,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 870 transitions. [2024-11-20 06:03:07,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:03:07,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:07,391 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:07,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 06:03:07,391 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:07,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:07,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1372907198, now seen corresponding path program 1 times [2024-11-20 06:03:07,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:07,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601294753] [2024-11-20 06:03:07,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:07,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:07,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:08,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:08,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:08,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:08,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:08,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:08,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:08,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:08,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601294753] [2024-11-20 06:03:08,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601294753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:08,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:08,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:03:08,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622507330] [2024-11-20 06:03:08,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:08,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:03:08,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:08,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:03:08,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:03:08,104 INFO L87 Difference]: Start difference. First operand 629 states and 870 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:08,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:08,686 INFO L93 Difference]: Finished difference Result 714 states and 985 transitions. [2024-11-20 06:03:08,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:03:08,687 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 157 [2024-11-20 06:03:08,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:08,690 INFO L225 Difference]: With dead ends: 714 [2024-11-20 06:03:08,690 INFO L226 Difference]: Without dead ends: 712 [2024-11-20 06:03:08,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:03:08,691 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 168 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:08,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 1039 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 06:03:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2024-11-20 06:03:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 577. [2024-11-20 06:03:08,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 423 states have (on average 1.2718676122931443) internal successors, (538), 429 states have internal predecessors, (538), 136 states have call successors, (136), 17 states have call predecessors, (136), 17 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-11-20 06:03:08,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 810 transitions. [2024-11-20 06:03:08,738 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 810 transitions. Word has length 157 [2024-11-20 06:03:08,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:08,739 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 810 transitions. [2024-11-20 06:03:08,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:08,739 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 810 transitions. [2024-11-20 06:03:08,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-20 06:03:08,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:08,740 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:08,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 06:03:08,741 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2059209339, now seen corresponding path program 1 times [2024-11-20 06:03:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:08,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475559928] [2024-11-20 06:03:08,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:08,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:08,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:08,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:08,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:08,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:08,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:08,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:08,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475559928] [2024-11-20 06:03:08,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475559928] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:03:08,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1075817682] [2024-11-20 06:03:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:08,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:08,874 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:03:08,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 06:03:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:08,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 06:03:08,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-20 06:03:09,077 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:03:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:09,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1075817682] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:03:09,211 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:03:09,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-11-20 06:03:09,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135609556] [2024-11-20 06:03:09,211 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:03:09,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 06:03:09,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:09,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 06:03:09,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 06:03:09,212 INFO L87 Difference]: Start difference. First operand 577 states and 810 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-20 06:03:09,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:09,362 INFO L93 Difference]: Finished difference Result 907 states and 1270 transitions. [2024-11-20 06:03:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 06:03:09,363 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 157 [2024-11-20 06:03:09,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:09,366 INFO L225 Difference]: With dead ends: 907 [2024-11-20 06:03:09,366 INFO L226 Difference]: Without dead ends: 372 [2024-11-20 06:03:09,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:03:09,368 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 107 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:09,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 174 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:03:09,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-20 06:03:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 364. [2024-11-20 06:03:09,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 253 states have (on average 1.2411067193675889) internal successors, (314), 256 states have internal predecessors, (314), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 06:03:09,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 502 transitions. [2024-11-20 06:03:09,397 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 502 transitions. Word has length 157 [2024-11-20 06:03:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:09,398 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 502 transitions. [2024-11-20 06:03:09,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-20 06:03:09,398 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 502 transitions. [2024-11-20 06:03:09,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 06:03:09,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:09,399 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:09,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 06:03:09,600 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,SelfDestructingSolverStorable10 [2024-11-20 06:03:09,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:09,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:09,601 INFO L85 PathProgramCache]: Analyzing trace with hash -7853572, now seen corresponding path program 1 times [2024-11-20 06:03:09,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:09,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438831776] [2024-11-20 06:03:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:09,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:09,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:09,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:09,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:09,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:09,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:09,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:09,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:09,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:09,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:09,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:09,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:09,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:09,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:09,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:09,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:09,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:09,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438831776] [2024-11-20 06:03:09,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438831776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:03:09,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098882060] [2024-11-20 06:03:09,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:09,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:09,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:09,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:03:09,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 06:03:09,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:09,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:03:09,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-20 06:03:09,964 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:03:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:10,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098882060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:03:10,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:03:10,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-20 06:03:10,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017050097] [2024-11-20 06:03:10,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:03:10,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 06:03:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 06:03:10,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:03:10,113 INFO L87 Difference]: Start difference. First operand 364 states and 502 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-20 06:03:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:10,366 INFO L93 Difference]: Finished difference Result 702 states and 967 transitions. [2024-11-20 06:03:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:03:10,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) Word has length 158 [2024-11-20 06:03:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:10,369 INFO L225 Difference]: With dead ends: 702 [2024-11-20 06:03:10,369 INFO L226 Difference]: Without dead ends: 384 [2024-11-20 06:03:10,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-20 06:03:10,370 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 153 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:10,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 428 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:03:10,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-20 06:03:10,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 376. [2024-11-20 06:03:10,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 265 states have (on average 1.230188679245283) internal successors, (326), 268 states have internal predecessors, (326), 94 states have call successors, (94), 16 states have call predecessors, (94), 16 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 06:03:10,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 514 transitions. [2024-11-20 06:03:10,398 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 514 transitions. Word has length 158 [2024-11-20 06:03:10,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:10,398 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 514 transitions. [2024-11-20 06:03:10,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 3 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 3 states have call predecessors, (55), 3 states have call successors, (55) [2024-11-20 06:03:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 514 transitions. [2024-11-20 06:03:10,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-20 06:03:10,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:10,400 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:10,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 06:03:10,600 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,SelfDestructingSolverStorable11 [2024-11-20 06:03:10,601 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:10,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:10,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1287717250, now seen corresponding path program 1 times [2024-11-20 06:03:10,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:10,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016722988] [2024-11-20 06:03:10,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:10,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:10,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:10,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:10,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:10,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:10,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:10,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016722988] [2024-11-20 06:03:10,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016722988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:03:10,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095667677] [2024-11-20 06:03:10,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:10,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:10,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:10,760 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:03:10,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 06:03:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:10,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 06:03:10,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:10,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 563 proven. 39 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-20 06:03:10,963 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:03:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:11,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095667677] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:03:11,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:03:11,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2024-11-20 06:03:11,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147332884] [2024-11-20 06:03:11,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:03:11,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 06:03:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 06:03:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2024-11-20 06:03:11,144 INFO L87 Difference]: Start difference. First operand 376 states and 514 transitions. Second operand has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 06:03:11,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:11,588 INFO L93 Difference]: Finished difference Result 938 states and 1258 transitions. [2024-11-20 06:03:11,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:03:11,589 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) Word has length 158 [2024-11-20 06:03:11,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:11,592 INFO L225 Difference]: With dead ends: 938 [2024-11-20 06:03:11,592 INFO L226 Difference]: Without dead ends: 608 [2024-11-20 06:03:11,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2024-11-20 06:03:11,594 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 315 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:11,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 484 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:03:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-20 06:03:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 413. [2024-11-20 06:03:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 298 states have (on average 1.238255033557047) internal successors, (369), 301 states have internal predecessors, (369), 94 states have call successors, (94), 20 states have call predecessors, (94), 20 states have return successors, (94), 91 states have call predecessors, (94), 94 states have call successors, (94) [2024-11-20 06:03:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 557 transitions. [2024-11-20 06:03:11,631 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 557 transitions. Word has length 158 [2024-11-20 06:03:11,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:11,631 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 557 transitions. [2024-11-20 06:03:11,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.1875) internal successors, (83), 16 states have internal predecessors, (83), 3 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (51), 3 states have call predecessors, (51), 3 states have call successors, (51) [2024-11-20 06:03:11,632 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 557 transitions. [2024-11-20 06:03:11,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 06:03:11,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:11,633 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:11,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 06:03:11,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:11,837 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:11,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:11,838 INFO L85 PathProgramCache]: Analyzing trace with hash -206242740, now seen corresponding path program 1 times [2024-11-20 06:03:11,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:11,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63634119] [2024-11-20 06:03:11,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:11,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:12,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:12,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:12,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:12,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:12,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:12,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:12,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:12,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:12,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:12,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:12,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:12,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 06:03:12,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:12,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63634119] [2024-11-20 06:03:12,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63634119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:12,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 06:03:12,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351317877] [2024-11-20 06:03:12,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 06:03:12,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:12,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 06:03:12,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 06:03:12,422 INFO L87 Difference]: Start difference. First operand 413 states and 557 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:12,867 INFO L93 Difference]: Finished difference Result 544 states and 730 transitions. [2024-11-20 06:03:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 06:03:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 159 [2024-11-20 06:03:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:12,870 INFO L225 Difference]: With dead ends: 544 [2024-11-20 06:03:12,870 INFO L226 Difference]: Without dead ends: 542 [2024-11-20 06:03:12,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-11-20 06:03:12,872 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 168 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:12,873 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 843 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 06:03:12,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2024-11-20 06:03:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 512. [2024-11-20 06:03:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 379 states have (on average 1.2348284960422165) internal successors, (468), 384 states have internal predecessors, (468), 110 states have call successors, (110), 22 states have call predecessors, (110), 22 states have return successors, (110), 105 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-20 06:03:12,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 688 transitions. [2024-11-20 06:03:12,929 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 688 transitions. Word has length 159 [2024-11-20 06:03:12,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:12,929 INFO L471 AbstractCegarLoop]: Abstraction has 512 states and 688 transitions. [2024-11-20 06:03:12,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:12,930 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 688 transitions. [2024-11-20 06:03:12,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-20 06:03:12,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:12,931 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:12,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 06:03:12,931 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:12,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:12,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1631246954, now seen corresponding path program 1 times [2024-11-20 06:03:12,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:12,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675586012] [2024-11-20 06:03:12,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:12,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:13,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:13,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:13,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:13,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:13,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:13,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:13,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:13,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:13,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:13,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:13,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:13,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:13,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675586012] [2024-11-20 06:03:13,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675586012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 06:03:13,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096594520] [2024-11-20 06:03:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:13,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:13,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:13,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:03:13,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 06:03:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:13,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 06:03:13,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:13,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 695 proven. 45 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-20 06:03:13,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 06:03:13,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:13,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096594520] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 06:03:13,403 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 06:03:13,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-20 06:03:13,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994940959] [2024-11-20 06:03:13,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 06:03:13,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 06:03:13,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:13,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 06:03:13,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2024-11-20 06:03:13,404 INFO L87 Difference]: Start difference. First operand 512 states and 688 transitions. Second operand has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-20 06:03:13,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:13,701 INFO L93 Difference]: Finished difference Result 1000 states and 1332 transitions. [2024-11-20 06:03:13,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 06:03:13,702 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) Word has length 159 [2024-11-20 06:03:13,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:13,705 INFO L225 Difference]: With dead ends: 1000 [2024-11-20 06:03:13,705 INFO L226 Difference]: Without dead ends: 538 [2024-11-20 06:03:13,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=162, Invalid=344, Unknown=0, NotChecked=0, Total=506 [2024-11-20 06:03:13,708 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 250 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:13,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 195 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:03:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-20 06:03:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 292. [2024-11-20 06:03:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 228 states have (on average 1.219298245614035) internal successors, (278), 230 states have internal predecessors, (278), 50 states have call successors, (50), 13 states have call predecessors, (50), 13 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 06:03:13,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 378 transitions. [2024-11-20 06:03:13,736 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 378 transitions. Word has length 159 [2024-11-20 06:03:13,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:13,737 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 378 transitions. [2024-11-20 06:03:13,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.5) internal successors, (77), 14 states have internal predecessors, (77), 6 states have call successors, (54), 3 states have call predecessors, (54), 5 states have return successors, (55), 6 states have call predecessors, (55), 6 states have call successors, (55) [2024-11-20 06:03:13,737 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 378 transitions. [2024-11-20 06:03:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 06:03:13,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:13,738 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:13,745 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 06:03:13,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-20 06:03:13,939 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:13,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:13,939 INFO L85 PathProgramCache]: Analyzing trace with hash 668717503, now seen corresponding path program 1 times [2024-11-20 06:03:13,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:13,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490957813] [2024-11-20 06:03:13,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:13,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 06:03:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 06:03:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 06:03:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 06:03:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 06:03:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 06:03:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 06:03:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 06:03:14,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 06:03:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 06:03:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 06:03:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 06:03:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 06:03:14,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 06:03:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 06:03:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 06:03:14,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 06:03:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 06:03:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 06:03:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-20 06:03:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-20 06:03:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-20 06:03:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-20 06:03:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-20 06:03:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:14,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 06:03:14,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490957813] [2024-11-20 06:03:14,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490957813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:14,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:14,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:03:14,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524836487] [2024-11-20 06:03:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:14,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:03:14,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 06:03:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:03:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:03:14,105 INFO L87 Difference]: Start difference. First operand 292 states and 378 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:14,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:14,299 INFO L93 Difference]: Finished difference Result 589 states and 760 transitions. [2024-11-20 06:03:14,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:03:14,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 160 [2024-11-20 06:03:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:14,301 INFO L225 Difference]: With dead ends: 589 [2024-11-20 06:03:14,301 INFO L226 Difference]: Without dead ends: 300 [2024-11-20 06:03:14,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:03:14,302 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 117 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:14,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 188 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 06:03:14,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2024-11-20 06:03:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 296. [2024-11-20 06:03:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.147186147186147) internal successors, (265), 233 states have internal predecessors, (265), 50 states have call successors, (50), 14 states have call predecessors, (50), 14 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 06:03:14,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 365 transitions. [2024-11-20 06:03:14,330 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 365 transitions. Word has length 160 [2024-11-20 06:03:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 365 transitions. [2024-11-20 06:03:14,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:14,331 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 365 transitions. [2024-11-20 06:03:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-20 06:03:14,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:14,332 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:14,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 06:03:14,332 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 81911489, now seen corresponding path program 1 times [2024-11-20 06:03:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 06:03:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779005399] [2024-11-20 06:03:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:14,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 06:03:14,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 06:03:14,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855578357] [2024-11-20 06:03:14,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:14,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 06:03:14,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:14,356 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 06:03:14,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 06:03:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:03:14,418 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 06:03:14,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 06:03:14,498 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 06:03:14,498 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 06:03:14,499 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 06:03:14,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 06:03:14,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 06:03:14,706 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:14,775 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 06:03:14,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 06:03:14 BoogieIcfgContainer [2024-11-20 06:03:14,777 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 06:03:14,778 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 06:03:14,778 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 06:03:14,778 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 06:03:14,778 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:02:54" (3/4) ... [2024-11-20 06:03:14,780 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 06:03:14,781 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 06:03:14,781 INFO L158 Benchmark]: Toolchain (without parser) took 20587.95ms. Allocated memory was 153.1MB in the beginning and 601.9MB in the end (delta: 448.8MB). Free memory was 84.3MB in the beginning and 431.3MB in the end (delta: -347.0MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,781 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 153.1MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:03:14,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.31ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 69.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,782 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.48ms. Allocated memory is still 153.1MB. Free memory was 69.5MB in the beginning and 66.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,782 INFO L158 Benchmark]: Boogie Preprocessor took 56.41ms. Allocated memory is still 153.1MB. Free memory was 66.5MB in the beginning and 63.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,782 INFO L158 Benchmark]: RCFGBuilder took 383.72ms. Allocated memory is still 153.1MB. Free memory was 62.9MB in the beginning and 104.4MB in the end (delta: -41.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,782 INFO L158 Benchmark]: TraceAbstraction took 19845.92ms. Allocated memory was 153.1MB in the beginning and 601.9MB in the end (delta: 448.8MB). Free memory was 103.7MB in the beginning and 432.4MB in the end (delta: -328.6MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. [2024-11-20 06:03:14,782 INFO L158 Benchmark]: Witness Printer took 3.06ms. Allocated memory is still 601.9MB. Free memory was 432.4MB in the beginning and 431.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 06:03:14,783 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.25ms. Allocated memory is still 153.1MB. Free memory is still 114.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.31ms. Allocated memory is still 153.1MB. Free memory was 84.1MB in the beginning and 69.5MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.48ms. Allocated memory is still 153.1MB. Free memory was 69.5MB in the beginning and 66.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.41ms. Allocated memory is still 153.1MB. Free memory was 66.5MB in the beginning and 63.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 383.72ms. Allocated memory is still 153.1MB. Free memory was 62.9MB in the beginning and 104.4MB in the end (delta: -41.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 19845.92ms. Allocated memory was 153.1MB in the beginning and 601.9MB in the end (delta: 448.8MB). Free memory was 103.7MB in the beginning and 432.4MB in the end (delta: -328.6MB). Peak memory consumption was 120.5MB. Max. memory is 16.1GB. * Witness Printer took 3.06ms. Allocated memory is still 601.9MB. Free memory was 432.4MB in the beginning and 431.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 112, overapproximation of bitwiseOr at line 54. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] signed long int var_1_2 = 4; [L24] signed long int var_1_3 = 64; [L25] signed long int var_1_4 = 64; [L26] signed long int var_1_5 = 0; [L27] signed short int var_1_7 = 10000; [L28] signed short int var_1_8 = 1; [L29] signed short int var_1_9 = 50; [L30] signed short int var_1_10 = 8; [L31] unsigned char var_1_13 = 2; [L32] unsigned char var_1_14 = 100; [L33] unsigned short int var_1_15 = 128; [L34] unsigned short int var_1_16 = 23647; [L35] unsigned short int var_1_17 = 32; [L36] signed char var_1_18 = 0; [L37] signed char var_1_19 = -50; [L38] unsigned char var_1_20 = 0; [L39] unsigned char var_1_21 = 0; VAL [isInitial=0, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=4, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] FCALL updateLastVariables() [L120] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_long() [L73] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L73] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L74] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=64, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L75] var_1_3 = __VERIFIER_nondet_long() [L76] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L76] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L77] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=64, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L78] var_1_4 = __VERIFIER_nondet_long() [L79] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L79] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L80] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L81] var_1_5 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L82] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L83] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=10000, var_1_8=1, var_1_9=50] [L84] var_1_7 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_7 >= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L85] RET assume_abort_if_not(var_1_7 >= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L86] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L87] var_1_8 = __VERIFIER_nondet_short() [L88] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L88] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_8 <= 8192) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L89] RET assume_abort_if_not(var_1_8 <= 8192) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=50] [L90] var_1_9 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] CALL assume_abort_if_not(var_1_9 <= 8191) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L92] RET assume_abort_if_not(var_1_9 <= 8191) VAL [isInitial=1, var_1_10=8, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L93] var_1_10 = __VERIFIER_nondet_short() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] CALL assume_abort_if_not(var_1_10 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L95] RET assume_abort_if_not(var_1_10 <= 32766) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=100, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L96] var_1_14 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L97] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] CALL assume_abort_if_not(var_1_14 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L98] RET assume_abort_if_not(var_1_14 <= 254) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=23647, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L99] var_1_16 = __VERIFIER_nondet_ushort() [L100] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L100] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L101] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=-50, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L102] var_1_19 = __VERIFIER_nondet_char() [L103] CALL assume_abort_if_not(var_1_19 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L103] RET assume_abort_if_not(var_1_19 >= -127) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L104] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L106] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] CALL assume_abort_if_not(var_1_21 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L107] RET assume_abort_if_not(var_1_21 <= 0) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=0, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L120] RET updateVariables() [L121] CALL step() [L43] var_1_18 = var_1_19 [L44] var_1_20 = var_1_21 [L45] signed char stepLocal_1 = var_1_18; [L46] signed long int stepLocal_0 = var_1_9 / var_1_7; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] EXPR var_1_8 << var_1_10 VAL [isInitial=1, stepLocal_0=0, stepLocal_1=3, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L47] COND FALSE !(stepLocal_1 > (var_1_8 << var_1_10)) [L54] EXPR var_1_7 ^ var_1_18 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=128, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L54] signed long int stepLocal_2 = var_1_7 ^ var_1_18; [L55] COND TRUE var_1_14 >= stepLocal_2 [L56] var_1_15 = (var_1_14 + (var_1_16 - var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L58] COND TRUE var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L59] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=32, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L69] var_1_17 = var_1_1 VAL [isInitial=1, stepLocal_0=0, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR var_1_8 << var_1_10 VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR ((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112] EXPR (((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L112-L113] return ((((((var_1_2 != ((((var_1_3) > ((var_1_4 - var_1_5))) ? (var_1_3) : ((var_1_4 - var_1_5))))) ? (var_1_20 ? (var_1_1 == ((signed short int) (((var_1_7 - 32) + (var_1_13 + var_1_13)) - var_1_13))) : 1) : (var_1_20 ? (var_1_1 == ((signed short int) var_1_18)) : (var_1_1 == ((signed short int) var_1_13)))) && ((var_1_18 > (var_1_8 << var_1_10)) ? (((var_1_9 / var_1_7) > -25) ? (var_1_13 == ((unsigned char) var_1_14)) : (var_1_13 == ((unsigned char) var_1_14))) : 1)) && ((var_1_14 >= (var_1_7 ^ var_1_18)) ? (var_1_15 == ((unsigned short int) (var_1_14 + (var_1_16 - var_1_13)))) : 1)) && (var_1_17 == ((unsigned short int) var_1_1))) && (var_1_18 == ((signed char) var_1_19))) && (var_1_20 == ((unsigned char) var_1_21)) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=1, var_1_13=2, var_1_14=1, var_1_15=16382, var_1_16=16383, var_1_17=64, var_1_18=3, var_1_19=3, var_1_1=64, var_1_20=0, var_1_21=0, var_1_2=-1, var_1_3=-1, var_1_4=0, var_1_5=0, var_1_7=8191, var_1_8=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.7s, OverallIterations: 17, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2604 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2558 mSDsluCounter, 8925 SdHoareTripleChecker+Invalid, 3.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6834 mSDsCounter, 643 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5681 IncrementalHoareTripleChecker+Invalid, 6324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 643 mSolverCounterUnsat, 2091 mSDtfsCounter, 5681 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2249 GetRequests, 2066 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=629occurred in iteration=9, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 1184 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 3457 NumberOfCodeBlocks, 3457 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 3745 ConstructedInterpolants, 0 QuantifiedInterpolants, 10046 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1394 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 24 InterpolantComputations, 12 PerfectInterpolantSequences, 25974/26496 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 06:03:14,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_floatingpointinfluence_no-floats_file-43.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 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 06:03:16,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 06:03:16,762 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 06:03:16,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 06:03:16,766 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 06:03:16,795 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 06:03:16,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 06:03:16,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 06:03:16,797 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 06:03:16,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 06:03:16,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 06:03:16,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 06:03:16,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 06:03:16,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 06:03:16,800 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 06:03:16,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 06:03:16,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 06:03:16,803 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 06:03:16,803 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 06:03:16,803 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 06:03:16,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 06:03:16,804 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 06:03:16,804 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 06:03:16,804 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 06:03:16,805 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 06:03:16,805 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 06:03:16,805 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 06:03:16,805 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 06:03:16,806 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 06:03:16,806 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 06:03:16,806 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 06:03:16,806 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 06:03:16,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 06:03:16,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 06:03:16,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:03:16,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 06:03:16,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 06:03:16,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 06:03:16,808 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 06:03:16,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 06:03:16,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 06:03:16,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 06:03:16,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 06:03:16,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 06:03:16,810 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 -> 459832ff19f29163e11bbddd7ad07903a7d5846182a7bd0f1d9d1891c3a83882 [2024-11-20 06:03:17,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 06:03:17,098 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 06:03:17,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 06:03:17,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 06:03:17,101 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 06:03:17,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:03:18,352 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 06:03:18,524 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 06:03:18,525 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:03:18,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143d670b8/1a6112c44e494398ae2f86460e9b3544/FLAG0ddf646a5 [2024-11-20 06:03:18,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/143d670b8/1a6112c44e494398ae2f86460e9b3544 [2024-11-20 06:03:18,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 06:03:18,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 06:03:18,554 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 06:03:18,555 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 06:03:18,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 06:03:18,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@120a8cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18, skipping insertion in model container [2024-11-20 06:03:18,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 06:03:18,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2024-11-20 06:03:18,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:03:18,808 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 06:03:18,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-43.i[916,929] [2024-11-20 06:03:18,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 06:03:18,866 INFO L204 MainTranslator]: Completed translation [2024-11-20 06:03:18,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18 WrapperNode [2024-11-20 06:03:18,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 06:03:18,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 06:03:18,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 06:03:18,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 06:03:18,874 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,914 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 130 [2024-11-20 06:03:18,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 06:03:18,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 06:03:18,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 06:03:18,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 06:03:18,925 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,939 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 06:03:18,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 06:03:18,951 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 06:03:18,951 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 06:03:18,951 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 06:03:18,952 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (1/1) ... [2024-11-20 06:03:18,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 06:03:18,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 06:03:18,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 06:03:18,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 06:03:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 06:03:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 06:03:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 06:03:19,021 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 06:03:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 06:03:19,022 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 06:03:19,090 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 06:03:19,092 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 06:03:19,345 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-20 06:03:19,345 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 06:03:19,357 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 06:03:19,357 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 06:03:19,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:03:19 BoogieIcfgContainer [2024-11-20 06:03:19,359 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 06:03:19,360 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 06:03:19,360 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 06:03:19,367 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 06:03:19,367 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 06:03:18" (1/3) ... [2024-11-20 06:03:19,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea29b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:03:19, skipping insertion in model container [2024-11-20 06:03:19,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 06:03:18" (2/3) ... [2024-11-20 06:03:19,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea29b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 06:03:19, skipping insertion in model container [2024-11-20 06:03:19,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 06:03:19" (3/3) ... [2024-11-20 06:03:19,371 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-43.i [2024-11-20 06:03:19,384 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 06:03:19,385 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 06:03:19,432 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 06:03:19,437 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;@16d3fac9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 06:03:19,437 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 06:03:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:03:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 06:03:19,454 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:19,454 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:19,455 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:19,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:19,462 INFO L85 PathProgramCache]: Analyzing trace with hash -791064050, now seen corresponding path program 1 times [2024-11-20 06:03:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:03:19,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1345771179] [2024-11-20 06:03:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:19,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:03:19,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:03:19,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:03:19,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 06:03:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:19,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 06:03:19,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2024-11-20 06:03:19,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:03:19,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:03:19,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1345771179] [2024-11-20 06:03:19,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1345771179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:19,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:19,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 06:03:19,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836700974] [2024-11-20 06:03:19,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:19,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 06:03:19,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:03:19,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 06:03:19,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:03:19,739 INFO L87 Difference]: Start difference. First operand has 63 states, 36 states have (on average 1.3055555555555556) internal successors, (47), 37 states have internal predecessors, (47), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:03:19,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:19,761 INFO L93 Difference]: Finished difference Result 119 states and 208 transitions. [2024-11-20 06:03:19,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 06:03:19,765 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 147 [2024-11-20 06:03:19,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:19,773 INFO L225 Difference]: With dead ends: 119 [2024-11-20 06:03:19,773 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 06:03:19,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 06:03:19,779 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:19,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 06:03:19,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 06:03:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-20 06:03:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 33 states have internal predecessors, (40), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:03:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 88 transitions. [2024-11-20 06:03:19,825 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 88 transitions. Word has length 147 [2024-11-20 06:03:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:19,825 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 88 transitions. [2024-11-20 06:03:19,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 06:03:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 88 transitions. [2024-11-20 06:03:19,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 06:03:19,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:19,830 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:19,837 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 06:03:20,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:03:20,032 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:20,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:20,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1986199026, now seen corresponding path program 1 times [2024-11-20 06:03:20,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:03:20,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186633815] [2024-11-20 06:03:20,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:20,035 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:03:20,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:03:20,038 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:03:20,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 06:03:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:20,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 06:03:20,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 06:03:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 06:03:20,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 06:03:20,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 06:03:20,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186633815] [2024-11-20 06:03:20,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186633815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 06:03:20,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 06:03:20,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 06:03:20,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376850273] [2024-11-20 06:03:20,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 06:03:20,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 06:03:20,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 06:03:20,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 06:03:20,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 06:03:20,309 INFO L87 Difference]: Start difference. First operand 59 states and 88 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 06:03:20,641 INFO L93 Difference]: Finished difference Result 123 states and 180 transitions. [2024-11-20 06:03:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 06:03:20,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) Word has length 147 [2024-11-20 06:03:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 06:03:20,645 INFO L225 Difference]: With dead ends: 123 [2024-11-20 06:03:20,645 INFO L226 Difference]: Without dead ends: 67 [2024-11-20 06:03:20,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2024-11-20 06:03:20,646 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 81 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 06:03:20,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 120 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 06:03:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-20 06:03:20,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2024-11-20 06:03:20,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 06:03:20,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-11-20 06:03:20,662 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 147 [2024-11-20 06:03:20,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 06:03:20,663 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-11-20 06:03:20,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-20 06:03:20,663 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-11-20 06:03:20,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-20 06:03:20,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 06:03:20,667 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 06:03:20,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 06:03:20,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:03:20,868 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 06:03:20,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 06:03:20,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1928940724, now seen corresponding path program 1 times [2024-11-20 06:03:20,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 06:03:20,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282905713] [2024-11-20 06:03:20,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 06:03:20,871 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 06:03:20,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 06:03:20,873 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 06:03:20,874 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 06:03:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 06:03:20,986 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-20 06:03:20,991 INFO L278 TraceCheckSpWp]: Computing forward predicates...