./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_variablewrapping_wrapper-s_file-38.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_variablewrapping_wrapper-s_file-38.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 a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:47:59,709 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:47:59,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:47:59,773 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:47:59,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:47:59,793 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:47:59,796 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:47:59,796 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:47:59,796 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:47:59,798 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:47:59,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:47:59,800 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:47:59,800 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:47:59,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:47:59,800 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:47:59,801 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:47:59,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:47:59,801 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:47:59,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:47:59,801 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:47:59,801 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:47:59,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:47:59,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:47:59,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:47:59,803 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:47:59,804 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:47:59,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:47:59,804 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:47:59,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:47:59,804 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:47:59,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:47:59,805 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:47:59,805 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:47:59,805 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:47:59,806 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:47:59,806 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:47:59,806 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:47:59,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:47:59,807 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:47:59,807 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:47:59,807 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:47:59,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:47:59,808 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 -> a66395e9b9e9d3ed5ab02e44ee80d513c62f29820549c5075cb60199ac316149 [2024-10-11 13:47:59,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:48:00,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:48:00,012 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:48:00,013 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:48:00,013 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:48:00,014 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-10-11 13:48:01,217 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:48:01,390 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:48:01,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-38.i [2024-10-11 13:48:01,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb77f65e9/8430af19b52e45c697ca8570ad853485/FLAG50bb368c9 [2024-10-11 13:48:01,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cb77f65e9/8430af19b52e45c697ca8570ad853485 [2024-10-11 13:48:01,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:48:01,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:48:01,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:01,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:48:01,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:48:01,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:01" (1/1) ... [2024-10-11 13:48:01,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df9de9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:01, skipping insertion in model container [2024-10-11 13:48:01,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:48:01" (1/1) ... [2024-10-11 13:48:01,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:48:01,943 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_variablewrapping_wrapper-s_file-38.i[916,929] [2024-10-11 13:48:02,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:02,024 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:48:02,032 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_variablewrapping_wrapper-s_file-38.i[916,929] [2024-10-11 13:48:02,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:48:02,083 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:48:02,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02 WrapperNode [2024-10-11 13:48:02,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:48:02,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:02,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:48:02,087 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:48:02,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,130 INFO L138 Inliner]: procedures = 29, calls = 177, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2024-10-11 13:48:02,131 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:48:02,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:48:02,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:48:02,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:48:02,143 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,143 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,152 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,174 INFO L175 MemorySlicer]: Split 141 memory accesses to 2 slices as follows [2, 139]. 99 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 19]. The 21 writes are split as follows [0, 21]. [2024-10-11 13:48:02,174 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,196 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,200 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,202 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,203 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,207 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:48:02,208 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:48:02,208 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:48:02,208 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:48:02,209 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (1/1) ... [2024-10-11 13:48:02,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:48:02,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:48:02,241 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 13:48:02,245 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 13:48:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:48:02,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:48:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:48:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:48:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:48:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:48:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:48:02,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:48:02,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:48:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:48:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:48:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:48:02,281 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:48:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:48:02,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:48:02,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:48:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:48:02,379 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:48:02,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:48:02,763 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-10-11 13:48:02,763 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:48:02,786 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:48:02,786 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:48:02,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:02 BoogieIcfgContainer [2024-10-11 13:48:02,787 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:48:02,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:48:02,788 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:48:02,791 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:48:02,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:48:01" (1/3) ... [2024-10-11 13:48:02,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60351ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:02, skipping insertion in model container [2024-10-11 13:48:02,791 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:48:02" (2/3) ... [2024-10-11 13:48:02,791 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60351ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:48:02, skipping insertion in model container [2024-10-11 13:48:02,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:48:02" (3/3) ... [2024-10-11 13:48:02,792 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-38.i [2024-10-11 13:48:02,804 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:48:02,805 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:48:02,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:48:02,857 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;@4bc16771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:48:02,857 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:48:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:48:02,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:02,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:02,877 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:02,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:02,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -819880438, now seen corresponding path program 1 times [2024-10-11 13:48:02,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549084473] [2024-10-11 13:48:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:03,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:03,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:03,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:03,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:03,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:03,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:03,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:03,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:03,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549084473] [2024-10-11 13:48:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549084473] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:03,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:03,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:48:03,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456947157] [2024-10-11 13:48:03,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:03,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:48:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:48:03,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:03,395 INFO L87 Difference]: Start difference. First operand has 115 states, 88 states have (on average 1.4090909090909092) internal successors, (124), 89 states have internal predecessors, (124), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 13:48:03,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:03,435 INFO L93 Difference]: Finished difference Result 227 states and 366 transitions. [2024-10-11 13:48:03,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:48:03,437 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2024-10-11 13:48:03,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:03,443 INFO L225 Difference]: With dead ends: 227 [2024-10-11 13:48:03,443 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 13:48:03,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:48:03,448 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:03,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:48:03,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 13:48:03,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 13:48:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 87 states have (on average 1.367816091954023) internal successors, (119), 87 states have internal predecessors, (119), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:48:03,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 167 transitions. [2024-10-11 13:48:03,488 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 167 transitions. Word has length 179 [2024-10-11 13:48:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 167 transitions. [2024-10-11 13:48:03,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 13:48:03,489 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 167 transitions. [2024-10-11 13:48:03,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:03,492 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:03,492 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:03,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:48:03,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1697839694, now seen corresponding path program 1 times [2024-10-11 13:48:03,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:03,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319491461] [2024-10-11 13:48:03,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:03,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:05,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:05,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:05,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:05,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319491461] [2024-10-11 13:48:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319491461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:48:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394545997] [2024-10-11 13:48:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:48:05,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:05,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:48:05,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:48:05,221 INFO L87 Difference]: Start difference. First operand 113 states and 167 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 13:48:05,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:05,561 INFO L93 Difference]: Finished difference Result 306 states and 452 transitions. [2024-10-11 13:48:05,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:48:05,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 179 [2024-10-11 13:48:05,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:05,564 INFO L225 Difference]: With dead ends: 306 [2024-10-11 13:48:05,564 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 13:48:05,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:48:05,567 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 107 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:05,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 489 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:48:05,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 13:48:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2024-10-11 13:48:05,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.375) internal successors, (209), 153 states have internal predecessors, (209), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:05,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 281 transitions. [2024-10-11 13:48:05,600 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 281 transitions. Word has length 179 [2024-10-11 13:48:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:05,601 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 281 transitions. [2024-10-11 13:48:05,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-10-11 13:48:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 281 transitions. [2024-10-11 13:48:05,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:05,603 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:05,603 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:05,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:48:05,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:05,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:05,607 INFO L85 PathProgramCache]: Analyzing trace with hash 306146674, now seen corresponding path program 1 times [2024-10-11 13:48:05,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:05,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828382628] [2024-10-11 13:48:05,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:05,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:08,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:08,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:08,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:08,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:08,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:08,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:08,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:08,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:08,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828382628] [2024-10-11 13:48:08,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828382628] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:08,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:08,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:48:08,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034060918] [2024-10-11 13:48:08,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:08,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:48:08,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:08,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:48:08,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:48:08,506 INFO L87 Difference]: Start difference. First operand 191 states and 281 transitions. Second operand has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:09,142 INFO L93 Difference]: Finished difference Result 456 states and 669 transitions. [2024-10-11 13:48:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 13:48:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2024-10-11 13:48:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:09,146 INFO L225 Difference]: With dead ends: 456 [2024-10-11 13:48:09,146 INFO L226 Difference]: Without dead ends: 266 [2024-10-11 13:48:09,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 13:48:09,148 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 47 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:09,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 991 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:48:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-10-11 13:48:09,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 213. [2024-10-11 13:48:09,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3735632183908046) internal successors, (239), 175 states have internal predecessors, (239), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:09,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 311 transitions. [2024-10-11 13:48:09,170 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 311 transitions. Word has length 179 [2024-10-11 13:48:09,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:09,170 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 311 transitions. [2024-10-11 13:48:09,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.888888888888889) internal successors, (62), 11 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 311 transitions. [2024-10-11 13:48:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:09,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:09,174 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:09,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:48:09,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:09,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:09,177 INFO L85 PathProgramCache]: Analyzing trace with hash 564312112, now seen corresponding path program 1 times [2024-10-11 13:48:09,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:09,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328591310] [2024-10-11 13:48:09,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:09,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:11,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:11,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:11,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:11,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:11,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:11,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:11,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:11,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:11,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328591310] [2024-10-11 13:48:11,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328591310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:11,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:11,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:48:11,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784964386] [2024-10-11 13:48:11,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:11,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:48:11,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:11,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:48:11,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:48:11,373 INFO L87 Difference]: Start difference. First operand 213 states and 311 transitions. Second operand has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:48:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:11,921 INFO L93 Difference]: Finished difference Result 541 states and 788 transitions. [2024-10-11 13:48:11,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:48:11,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) Word has length 179 [2024-10-11 13:48:11,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:11,925 INFO L225 Difference]: With dead ends: 541 [2024-10-11 13:48:11,925 INFO L226 Difference]: Without dead ends: 329 [2024-10-11 13:48:11,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:48:11,929 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 92 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:11,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 936 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:48:11,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2024-10-11 13:48:11,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 213. [2024-10-11 13:48:11,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:11,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2024-10-11 13:48:11,941 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 179 [2024-10-11 13:48:11,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:11,942 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2024-10-11 13:48:11,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 8.857142857142858) internal successors, (62), 10 states have internal predecessors, (62), 4 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 4 states have call successors, (24) [2024-10-11 13:48:11,942 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2024-10-11 13:48:11,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:11,943 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:11,944 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:11,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:48:11,944 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:11,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:11,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1382797068, now seen corresponding path program 1 times [2024-10-11 13:48:11,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:11,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459487679] [2024-10-11 13:48:11,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:11,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:13,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:13,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:13,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:13,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:13,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:13,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:13,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:13,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:13,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:13,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:13,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459487679] [2024-10-11 13:48:13,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459487679] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:13,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:13,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:48:13,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540680683] [2024-10-11 13:48:13,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:13,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:48:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:48:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:48:13,677 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:14,089 INFO L93 Difference]: Finished difference Result 497 states and 721 transitions. [2024-10-11 13:48:14,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:48:14,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2024-10-11 13:48:14,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:14,092 INFO L225 Difference]: With dead ends: 497 [2024-10-11 13:48:14,092 INFO L226 Difference]: Without dead ends: 285 [2024-10-11 13:48:14,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:48:14,093 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 47 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:14,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 908 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:48:14,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-11 13:48:14,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 229. [2024-10-11 13:48:14,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 190 states have (on average 1.368421052631579) internal successors, (260), 191 states have internal predecessors, (260), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:14,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 332 transitions. [2024-10-11 13:48:14,106 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 332 transitions. Word has length 179 [2024-10-11 13:48:14,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:14,107 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 332 transitions. [2024-10-11 13:48:14,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:14,107 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 332 transitions. [2024-10-11 13:48:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:14,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:14,109 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:14,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:48:14,109 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:14,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:14,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1124631630, now seen corresponding path program 1 times [2024-10-11 13:48:14,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:14,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156702391] [2024-10-11 13:48:14,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:14,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:15,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:15,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:15,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:15,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:15,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:15,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:15,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:15,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:15,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:15,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156702391] [2024-10-11 13:48:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156702391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:15,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:48:15,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230358673] [2024-10-11 13:48:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:15,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:48:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:48:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:48:15,527 INFO L87 Difference]: Start difference. First operand 229 states and 332 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:15,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:15,809 INFO L93 Difference]: Finished difference Result 505 states and 732 transitions. [2024-10-11 13:48:15,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:48:15,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2024-10-11 13:48:15,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:15,811 INFO L225 Difference]: With dead ends: 505 [2024-10-11 13:48:15,811 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 13:48:15,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:48:15,812 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 43 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:15,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 750 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:48:15,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 13:48:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 213. [2024-10-11 13:48:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3620689655172413) internal successors, (237), 175 states have internal predecessors, (237), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 309 transitions. [2024-10-11 13:48:15,822 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 309 transitions. Word has length 179 [2024-10-11 13:48:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:15,823 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 309 transitions. [2024-10-11 13:48:15,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:15,823 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 309 transitions. [2024-10-11 13:48:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:15,825 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:15,825 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:15,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:48:15,825 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:15,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:15,826 INFO L85 PathProgramCache]: Analyzing trace with hash 728848500, now seen corresponding path program 1 times [2024-10-11 13:48:15,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:15,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100123937] [2024-10-11 13:48:15,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:15,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:15,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:17,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:17,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:17,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:17,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:17,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:17,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:17,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:17,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100123937] [2024-10-11 13:48:17,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100123937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:17,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:17,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:48:17,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217577817] [2024-10-11 13:48:17,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:17,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:48:17,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:17,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:48:17,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:48:17,350 INFO L87 Difference]: Start difference. First operand 213 states and 309 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:17,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:17,652 INFO L93 Difference]: Finished difference Result 473 states and 686 transitions. [2024-10-11 13:48:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:48:17,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2024-10-11 13:48:17,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:17,655 INFO L225 Difference]: With dead ends: 473 [2024-10-11 13:48:17,655 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 13:48:17,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:48:17,657 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 45 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:17,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 693 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:48:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 13:48:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 213. [2024-10-11 13:48:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 174 states have (on average 1.3505747126436782) internal successors, (235), 175 states have internal predecessors, (235), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 13:48:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 307 transitions. [2024-10-11 13:48:17,670 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 307 transitions. Word has length 179 [2024-10-11 13:48:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:17,671 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 307 transitions. [2024-10-11 13:48:17,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 307 transitions. [2024-10-11 13:48:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-10-11 13:48:17,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:17,673 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:17,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:48:17,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:17,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:17,674 INFO L85 PathProgramCache]: Analyzing trace with hash 987013938, now seen corresponding path program 1 times [2024-10-11 13:48:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:17,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533829364] [2024-10-11 13:48:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:17,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:17,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:48:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:48:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:48:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:48:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 13:48:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 13:48:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:48:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-11 13:48:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 13:48:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:48:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 13:48:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:48:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 13:48:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 13:48:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 13:48:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 13:48:18,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 13:48:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 13:48:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 13:48:18,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 13:48:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 13:48:18,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 13:48:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 13:48:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 13:48:18,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-10-11 13:48:18,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:48:18,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533829364] [2024-10-11 13:48:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533829364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:48:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:48:18,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 13:48:18,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580235690] [2024-10-11 13:48:18,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:48:18,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 13:48:18,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:48:18,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 13:48:18,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:48:18,999 INFO L87 Difference]: Start difference. First operand 213 states and 307 transitions. Second operand has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:48:19,490 INFO L93 Difference]: Finished difference Result 489 states and 700 transitions. [2024-10-11 13:48:19,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:48:19,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) Word has length 179 [2024-10-11 13:48:19,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:48:19,493 INFO L225 Difference]: With dead ends: 489 [2024-10-11 13:48:19,493 INFO L226 Difference]: Without dead ends: 277 [2024-10-11 13:48:19,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:48:19,494 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 52 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1183 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:48:19,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1183 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:48:19,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-10-11 13:48:19,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 273. [2024-10-11 13:48:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 228 states have (on average 1.355263157894737) internal successors, (309), 231 states have internal predecessors, (309), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:48:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 389 transitions. [2024-10-11 13:48:19,509 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 389 transitions. Word has length 179 [2024-10-11 13:48:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:48:19,510 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 389 transitions. [2024-10-11 13:48:19,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.75) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 3 states have call successors, (24) [2024-10-11 13:48:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 389 transitions. [2024-10-11 13:48:19,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 13:48:19,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:48:19,511 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:48:19,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:48:19,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:48:19,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:48:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1777980137, now seen corresponding path program 1 times [2024-10-11 13:48:19,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:48:19,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723876432] [2024-10-11 13:48:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:48:19,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:48:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:48:43,357 WARN L286 SmtUtils]: Spent 6.97s on a formula simplification that was a NOOP. DAG size: 63 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 13:48:53,158 WARN L286 SmtUtils]: Spent 5.12s on a formula simplification that was a NOOP. DAG size: 47 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 13:49:03,659 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-11 13:49:11,666 WARN L286 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 53 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)