./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_fillercodesize_ps-cn-10_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:06:55,612 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:06:55,673 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:06:55,679 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:06:55,682 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:06:55,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:06:55,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:06:55,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:06:55,714 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:06:55,715 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:06:55,715 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:06:55,715 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:06:55,716 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:06:55,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:06:55,718 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:06:55,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:06:55,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:06:55,719 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:06:55,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:06:55,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:06:55,720 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:06:55,723 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:06:55,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:06:55,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:06:55,724 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:06:55,724 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:06:55,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:06:55,725 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:06:55,725 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:06:55,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:06:55,725 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:06:55,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:06:55,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:55,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:06:55,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:06:55,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:06:55,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:06:55,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:06:55,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:06:55,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:06:55,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:06:55,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:06:55,728 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-clean/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-clean/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 -> 4623efc2673ee52abd070f0d21e51a11b98cc22b8397a5181b7ee0443b3e1285 [2024-10-11 08:06:56,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:06:56,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:06:56,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:06:56,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:06:56,044 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:06:56,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-11 08:06:57,536 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:06:57,756 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:06:57,756 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-11 08:06:57,765 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34043b78a/14e2c7dafb434d499feafb5cc05ebd0c/FLAG174901433 [2024-10-11 08:06:57,778 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/34043b78a/14e2c7dafb434d499feafb5cc05ebd0c [2024-10-11 08:06:57,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:06:57,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:06:57,786 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:57,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:06:57,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:06:57,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:57" (1/1) ... [2024-10-11 08:06:57,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@331cf652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:57, skipping insertion in model container [2024-10-11 08:06:57,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:06:57" (1/1) ... [2024-10-11 08:06:57,829 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:06:58,019 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_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-10-11 08:06:58,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:58,116 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:06:58,132 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_fillercodesize_ps-cn-10_file-56.i[915,928] [2024-10-11 08:06:58,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:06:58,189 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:06:58,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58 WrapperNode [2024-10-11 08:06:58,190 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:06:58,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:58,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:06:58,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:06:58,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,259 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 198 [2024-10-11 08:06:58,260 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:06:58,260 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:06:58,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:06:58,261 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:06:58,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,283 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,321 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-11 08:06:58,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,361 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:06:58,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:06:58,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:06:58,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:06:58,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (1/1) ... [2024-10-11 08:06:58,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:06:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:06:58,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:06:58,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:06:58,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:06:58,462 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:06:58,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:06:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:06:58,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:06:58,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:06:58,583 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:06:58,587 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:06:59,050 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 08:06:59,050 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:06:59,098 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:06:59,099 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:06:59,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:59 BoogieIcfgContainer [2024-10-11 08:06:59,100 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:06:59,102 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:06:59,102 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:06:59,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:06:59,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:06:57" (1/3) ... [2024-10-11 08:06:59,107 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b73e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:59, skipping insertion in model container [2024-10-11 08:06:59,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:06:58" (2/3) ... [2024-10-11 08:06:59,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14b73e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:06:59, skipping insertion in model container [2024-10-11 08:06:59,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:06:59" (3/3) ... [2024-10-11 08:06:59,110 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-56.i [2024-10-11 08:06:59,127 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:06:59,127 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:06:59,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:06:59,210 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;@336c92e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:06:59,211 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:06:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:06:59,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 08:06:59,235 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:06:59,237 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:06:59,238 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:06:59,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:06:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -990600732, now seen corresponding path program 1 times [2024-10-11 08:06:59,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:06:59,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830584036] [2024-10-11 08:06:59,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:06:59,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:06:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:06:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:06:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:06:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:06:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:06:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:06:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:06:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:06:59,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:06:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:06:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:06:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:06:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:06:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:06:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:06:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:06:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:06:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:06:59,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:06:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:06:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:06:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:06:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:06:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:06:59,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:06:59,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:06:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:06:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:06:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:06:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:06:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:06:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:06:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:06:59,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:06:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:06:59,852 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:06:59,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:06:59,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830584036] [2024-10-11 08:06:59,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830584036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:06:59,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:06:59,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:06:59,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243514870] [2024-10-11 08:06:59,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:06:59,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:06:59,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:06:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:06:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:06:59,894 INFO L87 Difference]: Start difference. First operand has 82 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 46 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:06:59,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:06:59,945 INFO L93 Difference]: Finished difference Result 161 states and 292 transitions. [2024-10-11 08:06:59,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:06:59,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 206 [2024-10-11 08:06:59,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:06:59,958 INFO L225 Difference]: With dead ends: 161 [2024-10-11 08:06:59,958 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 08:06:59,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 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-11 08:06:59,967 INFO L432 NwaCegarLoop]: 122 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, 122 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-11 08:06:59,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:06:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 08:07:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 08:07:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:07:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2024-10-11 08:07:00,039 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 206 [2024-10-11 08:07:00,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:00,041 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2024-10-11 08:07:00,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:07:00,042 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2024-10-11 08:07:00,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 08:07:00,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:00,068 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:07:00,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:07:00,069 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:00,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:00,069 INFO L85 PathProgramCache]: Analyzing trace with hash -621579484, now seen corresponding path program 1 times [2024-10-11 08:07:00,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:07:00,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502575523] [2024-10-11 08:07:00,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:00,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:07:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:07:00,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:07:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:07:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:07:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:07:00,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:07:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:07:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:07:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:07:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:07:00,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:07:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:07:00,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:07:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:07:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:07:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:07:00,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:07:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:07:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:07:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:07:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:07:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:07:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:07:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:07:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:07:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:07:00,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:07:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:07:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:07:00,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:07:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:07:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:07:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:07:00,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:07:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:07:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:07:00,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502575523] [2024-10-11 08:07:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502575523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:00,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:07:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931381055] [2024-10-11 08:07:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:00,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:07:00,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:07:00,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:07:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:07:00,587 INFO L87 Difference]: Start difference. First operand 80 states and 125 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:07:00,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:00,663 INFO L93 Difference]: Finished difference Result 224 states and 349 transitions. [2024-10-11 08:07:00,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:07:00,664 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 206 [2024-10-11 08:07:00,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:00,670 INFO L225 Difference]: With dead ends: 224 [2024-10-11 08:07:00,672 INFO L226 Difference]: Without dead ends: 145 [2024-10-11 08:07:00,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:07:00,674 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 97 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:00,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 235 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:07:00,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-11 08:07:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2024-10-11 08:07:00,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 77 states have (on average 1.2727272727272727) internal successors, (98), 78 states have internal predecessors, (98), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-11 08:07:00,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 222 transitions. [2024-10-11 08:07:00,704 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 222 transitions. Word has length 206 [2024-10-11 08:07:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:00,705 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 222 transitions. [2024-10-11 08:07:00,706 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:07:00,706 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 222 transitions. [2024-10-11 08:07:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 08:07:00,709 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:00,709 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:07:00,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:07:00,710 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:00,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:00,711 INFO L85 PathProgramCache]: Analyzing trace with hash 389537766, now seen corresponding path program 1 times [2024-10-11 08:07:00,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:07:00,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582981520] [2024-10-11 08:07:00,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:00,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:07:00,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:07:01,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:07:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:07:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:07:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:07:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:07:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:07:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:07:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:07:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 08:07:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:07:01,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 08:07:01,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 08:07:01,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 08:07:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 08:07:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 08:07:01,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 08:07:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 08:07:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 08:07:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 08:07:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 08:07:01,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 08:07:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 08:07:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 08:07:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 08:07:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-11 08:07:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 08:07:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 08:07:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 08:07:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-10-11 08:07:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 08:07:01,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-10-11 08:07:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-10-11 08:07:01,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-10-11 08:07:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:07:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:07:01,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:07:01,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582981520] [2024-10-11 08:07:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582981520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:07:01,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:07:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:07:01,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564224719] [2024-10-11 08:07:01,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:07:01,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:07:01,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:07:01,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:07:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:07:01,771 INFO L87 Difference]: Start difference. First operand 142 states and 222 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:07:01,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:07:01,901 INFO L93 Difference]: Finished difference Result 355 states and 545 transitions. [2024-10-11 08:07:01,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:07:01,902 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 206 [2024-10-11 08:07:01,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:07:01,907 INFO L225 Difference]: With dead ends: 355 [2024-10-11 08:07:01,909 INFO L226 Difference]: Without dead ends: 214 [2024-10-11 08:07:01,910 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:07:01,911 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 64 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:07:01,914 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 377 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:07:01,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-11 08:07:01,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 192. [2024-10-11 08:07:01,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 117 states have (on average 1.3162393162393162) internal successors, (154), 120 states have internal predecessors, (154), 70 states have call successors, (70), 4 states have call predecessors, (70), 4 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 08:07:01,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 294 transitions. [2024-10-11 08:07:01,958 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 294 transitions. Word has length 206 [2024-10-11 08:07:01,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:07:01,959 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 294 transitions. [2024-10-11 08:07:01,960 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, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:07:01,961 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 294 transitions. [2024-10-11 08:07:01,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2024-10-11 08:07:01,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:07:01,965 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 08:07:01,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:07:01,966 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:07:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:07:01,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2130422168, now seen corresponding path program 1 times [2024-10-11 08:07:01,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:07:01,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953510518] [2024-10-11 08:07:01,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:07:01,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:07:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat