./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-25_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.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 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:28:55,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:28:55,944 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:28:55,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:28:55,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:28:55,998 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:28:55,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:28:55,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:28:56,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:28:56,000 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:28:56,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:28:56,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:28:56,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:28:56,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:28:56,002 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:28:56,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:28:56,003 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:28:56,003 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:28:56,004 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:28:56,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:28:56,005 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:28:56,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:28:56,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:28:56,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:28:56,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:28:56,006 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:28:56,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:28:56,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:28:56,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:28:56,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:28:56,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:28:56,008 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:28:56,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:28:56,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:28:56,009 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:28:56,009 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:28:56,009 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:28:56,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:28:56,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:28:56,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:28:56,010 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:28:56,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:28:56,011 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 -> 4d936c2bc359502c9cc80babbbddc5f5ec41bb334054fc0df7f5bb21f4158f99 [2024-11-20 03:28:56,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:28:56,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:28:56,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:28:56,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:28:56,352 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:28:56,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-20 03:28:57,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:28:57,942 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:28:57,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-20 03:28:57,953 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193da0418/cd3d02a3e2374bc8b7c5529717a16989/FLAGe3ee65d8f [2024-11-20 03:28:57,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/193da0418/cd3d02a3e2374bc8b7c5529717a16989 [2024-11-20 03:28:57,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:28:57,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:28:57,973 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:28:57,973 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:28:57,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:28:57,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:57" (1/1) ... [2024-11-20 03:28:57,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@773f1bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:57, skipping insertion in model container [2024-11-20 03:28:57,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:57" (1/1) ... [2024-11-20 03:28:58,015 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:28:58,213 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-20 03:28:58,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:28:58,301 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:28:58,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-10.i[915,928] [2024-11-20 03:28:58,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:28:58,378 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:28:58,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58 WrapperNode [2024-11-20 03:28:58,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:28:58,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:28:58,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:28:58,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:28:58,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,446 INFO L138 Inliner]: procedures = 26, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 242 [2024-11-20 03:28:58,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:28:58,447 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:28:58,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:28:58,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:28:58,458 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,463 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,481 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 03:28:58,485 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,485 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,508 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,515 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,520 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,526 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:28:58,540 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:28:58,540 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:28:58,540 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:28:58,541 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (1/1) ... [2024-11-20 03:28:58,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:28:58,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:28:58,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 03:28:58,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 03:28:58,633 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:28:58,634 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:28:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:28:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:28:58,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:28:58,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:28:58,769 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:28:58,772 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:28:59,268 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-20 03:28:59,269 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:28:59,289 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:28:59,292 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:28:59,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:59 BoogieIcfgContainer [2024-11-20 03:28:59,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:28:59,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:28:59,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:28:59,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:28:59,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:28:57" (1/3) ... [2024-11-20 03:28:59,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25253bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:28:59, skipping insertion in model container [2024-11-20 03:28:59,300 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:58" (2/3) ... [2024-11-20 03:28:59,300 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25253bc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:28:59, skipping insertion in model container [2024-11-20 03:28:59,301 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:59" (3/3) ... [2024-11-20 03:28:59,302 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-10.i [2024-11-20 03:28:59,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:28:59,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:28:59,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:28:59,390 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;@8a9d350, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:28:59,390 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:28:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 03:28:59,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 03:28:59,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:28:59,410 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:28:59,411 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:28:59,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:28:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash -133426666, now seen corresponding path program 1 times [2024-11-20 03:28:59,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:28:59,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536178626] [2024-11-20 03:28:59,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:28:59,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:28:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:28:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:28:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:28:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:28:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:28:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:28:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:28:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:28:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:28:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:28:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:28:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:28:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:28:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:28:59,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:28:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:28:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:28:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:28:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:28:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:28:59,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:28:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:28:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:28:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:28:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:28:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:28:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:28:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:28:59,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:28:59,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:28:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-20 03:28:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:28:59,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-20 03:28:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 03:29:00,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:29:00,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536178626] [2024-11-20 03:29:00,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536178626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:29:00,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:29:00,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:29:00,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279854093] [2024-11-20 03:29:00,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:29:00,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:29:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:29:00,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:29:00,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:29:00,042 INFO L87 Difference]: Start difference. First operand has 105 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 03:29:00,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:29:00,087 INFO L93 Difference]: Finished difference Result 203 states and 344 transitions. [2024-11-20 03:29:00,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:29:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) Word has length 208 [2024-11-20 03:29:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:29:00,098 INFO L225 Difference]: With dead ends: 203 [2024-11-20 03:29:00,099 INFO L226 Difference]: Without dead ends: 101 [2024-11-20 03:29:00,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:29:00,110 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:29:00,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:29:00,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-20 03:29:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-20 03:29:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 03:29:00,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2024-11-20 03:29:00,180 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 208 [2024-11-20 03:29:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:29:00,181 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2024-11-20 03:29:00,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 03:29:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2024-11-20 03:29:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-20 03:29:00,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:29:00,189 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:29:00,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:29:00,190 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:29:00,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:29:00,191 INFO L85 PathProgramCache]: Analyzing trace with hash 375102870, now seen corresponding path program 1 times [2024-11-20 03:29:00,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:29:00,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369585199] [2024-11-20 03:29:00,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:29:00,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:29:00,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:29:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:29:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:29:00,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:29:00,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:29:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:29:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:29:00,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:29:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:29:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:29:00,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:29:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:29:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:29:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:29:00,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:29:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:29:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:29:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:29:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:29:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:29:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:29:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:29:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:29:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:29:00,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:29:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:29:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:29:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:29:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:29:00,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:29:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-20 03:29:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-20 03:29:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:29:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 03:29:00,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:29:00,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369585199] [2024-11-20 03:29:00,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369585199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:29:00,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:29:00,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:29:00,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732396155] [2024-11-20 03:29:00,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:29:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:29:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:29:00,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:29:00,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:29:00,994 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 03:29:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:29:01,271 INFO L93 Difference]: Finished difference Result 298 states and 451 transitions. [2024-11-20 03:29:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:29:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 208 [2024-11-20 03:29:01,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:29:01,277 INFO L225 Difference]: With dead ends: 298 [2024-11-20 03:29:01,277 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 03:29:01,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:29:01,279 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 98 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:29:01,279 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 579 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:29:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 03:29:01,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 166. [2024-11-20 03:29:01,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.2525252525252526) internal successors, (124), 99 states have internal predecessors, (124), 64 states have call successors, (64), 2 states have call predecessors, (64), 2 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 03:29:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 252 transitions. [2024-11-20 03:29:01,313 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 252 transitions. Word has length 208 [2024-11-20 03:29:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:29:01,314 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 252 transitions. [2024-11-20 03:29:01,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2024-11-20 03:29:01,315 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 252 transitions. [2024-11-20 03:29:01,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 03:29:01,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:29:01,321 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:29:01,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:29:01,321 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:29:01,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:29:01,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1872658368, now seen corresponding path program 1 times [2024-11-20 03:29:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:29:01,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710216874] [2024-11-20 03:29:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:29:01,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:29:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:30:01,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:30:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:30:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:30:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:30:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:30:01,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:30:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:30:01,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:30:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:30:01,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:30:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:30:01,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:30:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:30:01,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:30:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:30:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:30:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:30:01,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:30:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:30:01,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:30:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:30:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:30:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:30:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:30:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:30:01,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:30:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:30:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:30:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:30:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-20 03:30:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-20 03:30:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 03:30:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:30:01,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710216874] [2024-11-20 03:30:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710216874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:30:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:30:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 03:30:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196169130] [2024-11-20 03:30:01,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:30:01,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 03:30:01,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:30:01,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 03:30:01,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-20 03:30:01,969 INFO L87 Difference]: Start difference. First operand 166 states and 252 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 03:30:05,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:30:05,177 INFO L93 Difference]: Finished difference Result 487 states and 711 transitions. [2024-11-20 03:30:05,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 03:30:05,178 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) Word has length 209 [2024-11-20 03:30:05,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:30:05,187 INFO L225 Difference]: With dead ends: 487 [2024-11-20 03:30:05,187 INFO L226 Difference]: Without dead ends: 389 [2024-11-20 03:30:05,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=208, Invalid=662, Unknown=0, NotChecked=0, Total=870 [2024-11-20 03:30:05,193 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 691 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 1412 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 691 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 1412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 03:30:05,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [691 Valid, 1004 Invalid, 1537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 1412 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 03:30:05,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-20 03:30:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 299. [2024-11-20 03:30:05,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 194 states have (on average 1.2525773195876289) internal successors, (243), 195 states have internal predecessors, (243), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 03:30:05,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 435 transitions. [2024-11-20 03:30:05,251 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 435 transitions. Word has length 209 [2024-11-20 03:30:05,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:30:05,253 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 435 transitions. [2024-11-20 03:30:05,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 3 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 3 states have call predecessors, (32), 3 states have call successors, (32) [2024-11-20 03:30:05,254 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 435 transitions. [2024-11-20 03:30:05,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 03:30:05,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:30:05,259 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:30:05,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:30:05,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:30:05,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:30:05,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2130823806, now seen corresponding path program 1 times [2024-11-20 03:30:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:30:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468682208] [2024-11-20 03:30:05,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:30:05,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:30:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:30:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:30:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:30:23,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:30:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:30:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:30:23,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:30:23,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 03:30:23,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-20 03:30:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 03:30:23,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-20 03:30:23,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-20 03:30:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-20 03:30:23,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 03:30:23,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-20 03:30:23,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-20 03:30:23,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-20 03:30:23,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-20 03:30:23,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-20 03:30:23,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:30:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:30:23,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 03:30:23,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:30:23,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 03:30:23,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:30:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-20 03:30:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-20 03:30:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-20 03:30:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-20 03:30:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-20 03:30:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-20 03:30:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-11-20 03:30:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:30:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2024-11-20 03:30:23,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:30:23,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468682208] [2024-11-20 03:30:23,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468682208] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:30:23,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:30:23,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 03:30:23,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347373407] [2024-11-20 03:30:23,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:30:23,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 03:30:23,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:30:23,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 03:30:23,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-20 03:30:23,129 INFO L87 Difference]: Start difference. First operand 299 states and 435 transitions. Second operand has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 03:30:25,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:30:25,519 INFO L93 Difference]: Finished difference Result 539 states and 767 transitions. [2024-11-20 03:30:25,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 03:30:25,519 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 209 [2024-11-20 03:30:25,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:30:25,525 INFO L225 Difference]: With dead ends: 539 [2024-11-20 03:30:25,525 INFO L226 Difference]: Without dead ends: 441 [2024-11-20 03:30:25,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=573, Unknown=0, NotChecked=0, Total=756 [2024-11-20 03:30:25,527 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 609 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1465 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 1586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 03:30:25,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 1130 Invalid, 1586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1465 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 03:30:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-20 03:30:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 301. [2024-11-20 03:30:25,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 196 states have (on average 1.2551020408163265) internal successors, (246), 197 states have internal predecessors, (246), 96 states have call successors, (96), 8 states have call predecessors, (96), 8 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 03:30:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 438 transitions. [2024-11-20 03:30:25,574 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 438 transitions. Word has length 209 [2024-11-20 03:30:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:30:25,574 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 438 transitions. [2024-11-20 03:30:25,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 15 states have internal predecessors, (52), 2 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2024-11-20 03:30:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 438 transitions. [2024-11-20 03:30:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-20 03:30:25,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:30:25,577 INFO L215 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:30:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:30:25,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:30:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:30:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1016018050, now seen corresponding path program 1 times [2024-11-20 03:30:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:30:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293035207] [2024-11-20 03:30:25,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:30:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:30:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat