./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.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 87733420fc6866c2df55ef4b023b69b15e736a1e84a3f3640bbd51006ac1ba6c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:59:38,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:59:38,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:59:38,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:59:38,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:59:38,127 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:59:38,130 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:59:38,130 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:59:38,131 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:59:38,132 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:59:38,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:59:38,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:59:38,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:59:38,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:59:38,134 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:59:38,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:59:38,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:59:38,135 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:59:38,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:59:38,136 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:59:38,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:59:38,137 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:59:38,137 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:59:38,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:59:38,138 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:59:38,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:59:38,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:59:38,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:59:38,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:59:38,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:59:38,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:59:38,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:59:38,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:59:38,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:59:38,141 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:59:38,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:59:38,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:59:38,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:59:38,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:59:38,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:59:38,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:59:38,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:59:38,143 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 -> 87733420fc6866c2df55ef4b023b69b15e736a1e84a3f3640bbd51006ac1ba6c [2024-10-13 02:59:38,401 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:59:38,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:59:38,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:59:38,435 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:59:38,435 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:59:38,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i [2024-10-13 02:59:39,876 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:59:40,109 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:59:40,110 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i [2024-10-13 02:59:40,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fcd0174/d267219167c64e07927553ea6506aa99/FLAG8b8779e8f [2024-10-13 02:59:40,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0fcd0174/d267219167c64e07927553ea6506aa99 [2024-10-13 02:59:40,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:59:40,466 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:59:40,468 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:59:40,468 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:59:40,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:59:40,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e535ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40, skipping insertion in model container [2024-10-13 02:59:40,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:59:40,651 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i[919,932] [2024-10-13 02:59:40,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:59:40,733 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:59:40,747 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i[919,932] [2024-10-13 02:59:40,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:59:40,808 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:59:40,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40 WrapperNode [2024-10-13 02:59:40,809 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:59:40,810 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:59:40,811 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:59:40,811 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:59:40,817 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,833 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,911 INFO L138 Inliner]: procedures = 26, calls = 57, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 279 [2024-10-13 02:59:40,915 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:59:40,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:59:40,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:59:40,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:59:40,928 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,928 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,932 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,975 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 02:59:40,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:40,979 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,001 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,010 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,021 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:59:41,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:59:41,045 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:59:41,045 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:59:41,050 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (1/1) ... [2024-10-13 02:59:41,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:59:41,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:59:41,097 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:59:41,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:59:41,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:59:41,140 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:59:41,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:59:41,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:59:41,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:59:41,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:59:41,217 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:59:41,218 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:59:41,497 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 02:59:41,500 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:59:41,537 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:59:41,538 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:59:41,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:59:41 BoogieIcfgContainer [2024-10-13 02:59:41,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:59:41,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:59:41,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:59:41,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:59:41,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:59:40" (1/3) ... [2024-10-13 02:59:41,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13058909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:59:41, skipping insertion in model container [2024-10-13 02:59:41,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:59:40" (2/3) ... [2024-10-13 02:59:41,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13058909 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:59:41, skipping insertion in model container [2024-10-13 02:59:41,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:59:41" (3/3) ... [2024-10-13 02:59:41,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-cn_file-95.i [2024-10-13 02:59:41,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:59:41,562 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:59:41,623 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:59:41,630 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;@429700b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:59:41,631 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:59:41,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:59:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-13 02:59:41,652 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:41,653 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:59:41,654 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:41,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:41,659 INFO L85 PathProgramCache]: Analyzing trace with hash -254708657, now seen corresponding path program 1 times [2024-10-13 02:59:41,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:41,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528734239] [2024-10-13 02:59:41,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:41,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:42,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:42,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:42,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:42,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:42,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:59:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:59:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:59:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:59:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:59:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:59:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:59:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:59:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:59:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:59:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:59:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:59:42,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:59:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:59:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 02:59:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:59:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-13 02:59:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:59:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-13 02:59:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:59:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-10-13 02:59:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:42,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-13 02:59:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-13 02:59:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,205 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-10-13 02:59:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:42,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528734239] [2024-10-13 02:59:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528734239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:42,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:42,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:59:42,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18058499] [2024-10-13 02:59:42,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:42,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:59:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:59:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:59:42,235 INFO L87 Difference]: Start difference. First operand has 116 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 70 states have internal predecessors, (100), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:59:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:42,286 INFO L93 Difference]: Finished difference Result 228 states and 416 transitions. [2024-10-13 02:59:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:59:42,288 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) Word has length 269 [2024-10-13 02:59:42,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:42,294 INFO L225 Difference]: With dead ends: 228 [2024-10-13 02:59:42,294 INFO L226 Difference]: Without dead ends: 113 [2024-10-13 02:59:42,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:59:42,302 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:42,304 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:59:42,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-13 02:59:42,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-13 02:59:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 44 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 02:59:42,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 180 transitions. [2024-10-13 02:59:42,344 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 180 transitions. Word has length 269 [2024-10-13 02:59:42,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:42,344 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 180 transitions. [2024-10-13 02:59:42,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 2 states have call successors, (44) [2024-10-13 02:59:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 180 transitions. [2024-10-13 02:59:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-13 02:59:42,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:42,349 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:59:42,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:59:42,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:42,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -353260841, now seen corresponding path program 1 times [2024-10-13 02:59:42,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:42,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247021368] [2024-10-13 02:59:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:59:42,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 02:59:42,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 02:59:42,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 02:59:42,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 02:59:42,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 02:59:42,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 02:59:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:59:42,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:59:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 02:59:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 02:59:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 02:59:42,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 02:59:42,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 02:59:42,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 02:59:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-13 02:59:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-13 02:59:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-13 02:59:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-13 02:59:42,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-13 02:59:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-13 02:59:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-13 02:59:42,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:42,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-13 02:59:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-13 02:59:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-13 02:59:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-13 02:59:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-13 02:59:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-13 02:59:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-13 02:59:43,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-13 02:59:43,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-13 02:59:43,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-13 02:59:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2024-10-13 02:59:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-13 02:59:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2024-10-13 02:59:43,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-13 02:59:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-13 02:59:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2024-10-13 02:59:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2024-10-13 02:59:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2024-10-13 02:59:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2024-10-13 02:59:43,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-13 02:59:43,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2024-10-13 02:59:43,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2024-10-13 02:59:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:59:43,244 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3784 trivial. 0 not checked. [2024-10-13 02:59:43,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:59:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247021368] [2024-10-13 02:59:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247021368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:59:43,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:59:43,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:59:43,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725381580] [2024-10-13 02:59:43,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:59:43,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:59:43,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:59:43,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:59:43,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:59:43,255 INFO L87 Difference]: Start difference. First operand 113 states and 180 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-10-13 02:59:43,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:59:43,545 INFO L93 Difference]: Finished difference Result 338 states and 539 transitions. [2024-10-13 02:59:43,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:59:43,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 269 [2024-10-13 02:59:43,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:59:43,550 INFO L225 Difference]: With dead ends: 338 [2024-10-13 02:59:43,550 INFO L226 Difference]: Without dead ends: 226 [2024-10-13 02:59:43,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:59:43,553 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 119 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:59:43,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 489 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:59:43,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-13 02:59:43,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 209. [2024-10-13 02:59:43,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 118 states have (on average 1.3559322033898304) internal successors, (160), 118 states have internal predecessors, (160), 88 states have call successors, (88), 2 states have call predecessors, (88), 2 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2024-10-13 02:59:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 336 transitions. [2024-10-13 02:59:43,604 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 336 transitions. Word has length 269 [2024-10-13 02:59:43,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:59:43,605 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 336 transitions. [2024-10-13 02:59:43,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2024-10-13 02:59:43,605 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 336 transitions. [2024-10-13 02:59:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2024-10-13 02:59:43,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:59:43,609 INFO L215 NwaCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:59:43,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:59:43,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:59:43,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:59:43,610 INFO L85 PathProgramCache]: Analyzing trace with hash 39766169, now seen corresponding path program 1 times [2024-10-13 02:59:43,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:59:43,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228253662] [2024-10-13 02:59:43,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:59:43,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:59:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat