./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU --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 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:08:35,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:08:35,412 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:08:35,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:08:35,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:08:35,464 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:08:35,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:08:35,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:08:35,468 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:08:35,470 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:08:35,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:08:35,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:08:35,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:08:35,472 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:08:35,472 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:08:35,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:08:35,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:08:35,479 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:08:35,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:08:35,480 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:08:35,480 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:08:35,481 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:08:35,481 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:08:35,482 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:08:35,482 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:08:35,482 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:08:35,483 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:08:35,483 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:08:35,483 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:08:35,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:08:35,484 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:08:35,484 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:08:35,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:35,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:08:35,489 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:08:35,489 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:08:35,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:08:35,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:08:35,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:08:35,490 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:08:35,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:08:35,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:08:35,491 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 47e8ddd221104cc805d3d68561579c1d0ceb215c71efab48659b0323dc3025dc [2024-10-31 22:08:35,818 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:08:35,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:08:35,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:08:35,857 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:08:35,857 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:08:35,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i Unable to find full path for "g++" [2024-10-31 22:08:37,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:08:38,245 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:08:38,248 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i [2024-10-31 22:08:38,262 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/data/0cc475a89/c3092cc50e99418597684178f1e524c7/FLAGdaed0cadd [2024-10-31 22:08:38,289 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/data/0cc475a89/c3092cc50e99418597684178f1e524c7 [2024-10-31 22:08:38,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:08:38,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:08:38,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:38,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:08:38,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:08:38,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:38" (1/1) ... [2024-10-31 22:08:38,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17ab9040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:38, skipping insertion in model container [2024-10-31 22:08:38,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:08:38" (1/1) ... [2024-10-31 22:08:38,352 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:08:38,623 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2024-10-31 22:08:38,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:38,842 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:08:38,870 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-71.i[916,929] [2024-10-31 22:08:38,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:08:39,015 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:08:39,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39 WrapperNode [2024-10-31 22:08:39,016 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:08:39,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:39,019 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:08:39,019 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:08:39,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,056 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,131 INFO L138 Inliner]: procedures = 27, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-10-31 22:08:39,132 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:08:39,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:08:39,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:08:39,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:08:39,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,169 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,226 INFO L175 MemorySlicer]: Split 139 memory accesses to 2 slices as follows [2, 137]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 33 writes are split as follows [0, 33]. [2024-10-31 22:08:39,227 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,227 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,266 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,276 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,280 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,285 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:08:39,303 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:08:39,303 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:08:39,303 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:08:39,306 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (1/1) ... [2024-10-31 22:08:39,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:08:39,329 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:08:39,353 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:08:39,358 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e03179d2-76da-4b02-8d00-f111685b3d7f/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:08:39,435 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:08:39,438 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:08:39,439 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:08:39,441 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:08:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:08:39,441 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:08:39,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:08:39,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:08:39,622 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:08:39,624 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:08:40,229 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-10-31 22:08:40,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:08:40,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:08:40,253 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:08:40,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:40 BoogieIcfgContainer [2024-10-31 22:08:40,254 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:08:40,256 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:08:40,256 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:08:40,261 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:08:40,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:08:38" (1/3) ... [2024-10-31 22:08:40,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70851d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:40, skipping insertion in model container [2024-10-31 22:08:40,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:08:39" (2/3) ... [2024-10-31 22:08:40,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70851d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:08:40, skipping insertion in model container [2024-10-31 22:08:40,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:08:40" (3/3) ... [2024-10-31 22:08:40,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-71.i [2024-10-31 22:08:40,283 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:08:40,283 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:08:40,345 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:08:40,352 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;@169bf0de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:08:40,352 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:08:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:08:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:08:40,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:40,372 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:40,373 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:40,379 INFO L85 PathProgramCache]: Analyzing trace with hash -312506901, now seen corresponding path program 1 times [2024-10-31 22:08:40,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:40,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291584016] [2024-10-31 22:08:40,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:40,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:40,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:40,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:40,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:40,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:40,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:40,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:40,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:40,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291584016] [2024-10-31 22:08:40,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291584016] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:40,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:40,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:08:40,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151021631] [2024-10-31 22:08:40,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:40,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:08:40,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:40,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:08:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:08:40,939 INFO L87 Difference]: Start difference. First operand has 105 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 84 states have internal predecessors, (115), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:40,984 INFO L93 Difference]: Finished difference Result 203 states and 319 transitions. [2024-10-31 22:08:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:08:40,986 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2024-10-31 22:08:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:40,996 INFO L225 Difference]: With dead ends: 203 [2024-10-31 22:08:40,996 INFO L226 Difference]: Without dead ends: 101 [2024-10-31 22:08:41,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-31 22:08:41,005 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:41,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:41,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-31 22:08:41,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-31 22:08:41,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:08:41,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 144 transitions. [2024-10-31 22:08:41,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 144 transitions. Word has length 144 [2024-10-31 22:08:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:41,080 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 144 transitions. [2024-10-31 22:08:41,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2024-10-31 22:08:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:08:41,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:41,088 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:41,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:08:41,088 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:41,090 INFO L85 PathProgramCache]: Analyzing trace with hash 693008529, now seen corresponding path program 1 times [2024-10-31 22:08:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144236485] [2024-10-31 22:08:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:41,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:41,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:41,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:41,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:41,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:41,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:41,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144236485] [2024-10-31 22:08:41,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144236485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:41,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:41,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:41,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922545991] [2024-10-31 22:08:41,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:41,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:41,569 INFO L87 Difference]: Start difference. First operand 101 states and 144 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:08:41,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:41,616 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2024-10-31 22:08:41,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:41,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-31 22:08:41,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:41,619 INFO L225 Difference]: With dead ends: 202 [2024-10-31 22:08:41,620 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:08:41,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:41,622 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:41,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 412 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:41,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:08:41,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2024-10-31 22:08:41,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.3170731707317074) internal successors, (108), 82 states have internal predecessors, (108), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:08:41,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2024-10-31 22:08:41,634 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 144 [2024-10-31 22:08:41,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:41,636 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2024-10-31 22:08:41,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:08:41,637 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2024-10-31 22:08:41,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:08:41,639 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:41,639 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:41,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:08:41,640 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:41,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:41,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1826951405, now seen corresponding path program 1 times [2024-10-31 22:08:41,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:41,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348327262] [2024-10-31 22:08:41,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:41,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:41,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:41,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:41,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:41,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:41,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:41,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:41,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:41,996 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:41,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:41,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348327262] [2024-10-31 22:08:41,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348327262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:42,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:42,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:08:42,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798730199] [2024-10-31 22:08:42,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:42,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:08:42,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:42,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:08:42,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:42,002 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:08:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:42,059 INFO L93 Difference]: Finished difference Result 206 states and 293 transitions. [2024-10-31 22:08:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:08:42,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 144 [2024-10-31 22:08:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:42,062 INFO L225 Difference]: With dead ends: 206 [2024-10-31 22:08:42,063 INFO L226 Difference]: Without dead ends: 106 [2024-10-31 22:08:42,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:08:42,066 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:42,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 415 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:08:42,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-31 22:08:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-10-31 22:08:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3095238095238095) internal successors, (110), 84 states have internal predecessors, (110), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 22:08:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 148 transitions. [2024-10-31 22:08:42,089 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 148 transitions. Word has length 144 [2024-10-31 22:08:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:42,090 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 148 transitions. [2024-10-31 22:08:42,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-31 22:08:42,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 148 transitions. [2024-10-31 22:08:42,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-31 22:08:42,093 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:42,094 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:08:42,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:42,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:42,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1825104363, now seen corresponding path program 1 times [2024-10-31 22:08:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958625785] [2024-10-31 22:08:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:42,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:43,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:43,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:43,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:43,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:43,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:43,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:43,372 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:43,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:43,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958625785] [2024-10-31 22:08:43,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958625785] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:08:43,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942387029] [2024-10-31 22:08:43,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:43,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:43,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:43,379 INFO L87 Difference]: Start difference. First operand 105 states and 148 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:44,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:44,136 INFO L93 Difference]: Finished difference Result 290 states and 408 transitions. [2024-10-31 22:08:44,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:44,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 144 [2024-10-31 22:08:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:44,140 INFO L225 Difference]: With dead ends: 290 [2024-10-31 22:08:44,140 INFO L226 Difference]: Without dead ends: 188 [2024-10-31 22:08:44,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:08:44,142 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 107 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:44,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 537 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:08:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-31 22:08:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 176. [2024-10-31 22:08:44,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.3125) internal successors, (189), 145 states have internal predecessors, (189), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:08:44,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 247 transitions. [2024-10-31 22:08:44,179 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 247 transitions. Word has length 144 [2024-10-31 22:08:44,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:44,180 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 247 transitions. [2024-10-31 22:08:44,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 247 transitions. [2024-10-31 22:08:44,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-31 22:08:44,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:44,188 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:44,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:08:44,188 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:44,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:44,189 INFO L85 PathProgramCache]: Analyzing trace with hash -872708680, now seen corresponding path program 1 times [2024-10-31 22:08:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:44,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287511724] [2024-10-31 22:08:44,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:44,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:44,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:45,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:45,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:45,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:45,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:45,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:45,994 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:45,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:45,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287511724] [2024-10-31 22:08:45,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287511724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:45,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:46,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:08:46,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891211119] [2024-10-31 22:08:46,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:46,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:08:46,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:46,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:08:46,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:08:46,002 INFO L87 Difference]: Start difference. First operand 176 states and 247 transitions. Second operand has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:46,852 INFO L93 Difference]: Finished difference Result 435 states and 613 transitions. [2024-10-31 22:08:46,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:08:46,853 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 145 [2024-10-31 22:08:46,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:46,858 INFO L225 Difference]: With dead ends: 435 [2024-10-31 22:08:46,861 INFO L226 Difference]: Without dead ends: 262 [2024-10-31 22:08:46,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:08:46,867 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 102 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:46,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 669 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-31 22:08:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-10-31 22:08:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 185. [2024-10-31 22:08:46,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 153 states have (on average 1.326797385620915) internal successors, (203), 154 states have internal predecessors, (203), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-31 22:08:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 261 transitions. [2024-10-31 22:08:46,910 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 261 transitions. Word has length 145 [2024-10-31 22:08:46,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:46,912 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 261 transitions. [2024-10-31 22:08:46,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 8.833333333333334) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 261 transitions. [2024-10-31 22:08:46,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:08:46,916 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:46,916 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:46,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:08:46,918 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:46,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:46,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1111641874, now seen corresponding path program 1 times [2024-10-31 22:08:46,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:46,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64062766] [2024-10-31 22:08:46,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:46,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:48,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:48,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:48,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:48,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:48,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:48,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64062766] [2024-10-31 22:08:48,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64062766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:48,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:48,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:08:48,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472306531] [2024-10-31 22:08:48,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:48,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:08:48,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:48,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:08:48,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:08:48,685 INFO L87 Difference]: Start difference. First operand 185 states and 261 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:49,216 INFO L93 Difference]: Finished difference Result 425 states and 595 transitions. [2024-10-31 22:08:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:08:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2024-10-31 22:08:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:49,219 INFO L225 Difference]: With dead ends: 425 [2024-10-31 22:08:49,220 INFO L226 Difference]: Without dead ends: 243 [2024-10-31 22:08:49,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:08:49,221 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 73 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:49,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 940 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:08:49,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2024-10-31 22:08:49,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 240. [2024-10-31 22:08:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 203 states have internal predecessors, (264), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-31 22:08:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 334 transitions. [2024-10-31 22:08:49,240 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 334 transitions. Word has length 146 [2024-10-31 22:08:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 334 transitions. [2024-10-31 22:08:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 334 transitions. [2024-10-31 22:08:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-10-31 22:08:49,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:49,243 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:49,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:08:49,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:49,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:49,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1492049167, now seen corresponding path program 1 times [2024-10-31 22:08:49,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:49,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411426188] [2024-10-31 22:08:49,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:49,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:50,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:50,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:50,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:50,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411426188] [2024-10-31 22:08:50,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411426188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:50,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:50,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:08:50,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227941669] [2024-10-31 22:08:50,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:50,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:08:50,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:50,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:08:50,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:08:50,669 INFO L87 Difference]: Start difference. First operand 240 states and 334 transitions. Second operand has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:51,000 INFO L93 Difference]: Finished difference Result 554 states and 770 transitions. [2024-10-31 22:08:51,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:08:51,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 146 [2024-10-31 22:08:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:51,003 INFO L225 Difference]: With dead ends: 554 [2024-10-31 22:08:51,003 INFO L226 Difference]: Without dead ends: 317 [2024-10-31 22:08:51,003 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 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-31 22:08:51,005 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 98 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:51,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 361 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:08:51,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-31 22:08:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 250. [2024-10-31 22:08:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 211 states have (on average 1.3127962085308056) internal successors, (277), 213 states have internal predecessors, (277), 35 states have call successors, (35), 3 states have call predecessors, (35), 3 states have return successors, (35), 33 states have call predecessors, (35), 35 states have call successors, (35) [2024-10-31 22:08:51,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 347 transitions. [2024-10-31 22:08:51,047 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 347 transitions. Word has length 146 [2024-10-31 22:08:51,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:51,048 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 347 transitions. [2024-10-31 22:08:51,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.8) internal successors, (54), 6 states have internal predecessors, (54), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:51,048 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 347 transitions. [2024-10-31 22:08:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-31 22:08:51,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:51,050 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:51,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:08:51,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -687424559, now seen corresponding path program 1 times [2024-10-31 22:08:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036807995] [2024-10-31 22:08:51,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:52,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:52,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:52,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:52,700 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036807995] [2024-10-31 22:08:52,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036807995] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:52,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:52,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:08:52,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514284774] [2024-10-31 22:08:52,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:08:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:52,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:08:52,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:08:52,703 INFO L87 Difference]: Start difference. First operand 250 states and 347 transitions. Second operand has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:08:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:53,990 INFO L93 Difference]: Finished difference Result 629 states and 864 transitions. [2024-10-31 22:08:53,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:08:53,991 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) Word has length 147 [2024-10-31 22:08:53,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:53,993 INFO L225 Difference]: With dead ends: 629 [2024-10-31 22:08:53,995 INFO L226 Difference]: Without dead ends: 382 [2024-10-31 22:08:53,996 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:08:53,997 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 164 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:53,998 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 770 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:08:53,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2024-10-31 22:08:54,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 352. [2024-10-31 22:08:54,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 295 states have (on average 1.2949152542372881) internal successors, (382), 299 states have internal predecessors, (382), 51 states have call successors, (51), 5 states have call predecessors, (51), 5 states have return successors, (51), 47 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-31 22:08:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 484 transitions. [2024-10-31 22:08:54,036 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 484 transitions. Word has length 147 [2024-10-31 22:08:54,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:54,037 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 484 transitions. [2024-10-31 22:08:54,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.875) internal successors, (55), 10 states have internal predecessors, (55), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 3 states have call successors, (19) [2024-10-31 22:08:54,037 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 484 transitions. [2024-10-31 22:08:54,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-31 22:08:54,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:54,041 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:54,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:08:54,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:54,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:54,042 INFO L85 PathProgramCache]: Analyzing trace with hash -838220110, now seen corresponding path program 1 times [2024-10-31 22:08:54,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778085412] [2024-10-31 22:08:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:55,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:55,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:55,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:55,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:55,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:55,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:55,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778085412] [2024-10-31 22:08:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778085412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:55,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:55,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:08:55,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001453937] [2024-10-31 22:08:55,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:55,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:08:55,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:55,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:08:55,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:08:55,535 INFO L87 Difference]: Start difference. First operand 352 states and 484 transitions. Second operand has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:08:56,213 INFO L93 Difference]: Finished difference Result 815 states and 1114 transitions. [2024-10-31 22:08:56,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:08:56,214 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 147 [2024-10-31 22:08:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:08:56,218 INFO L225 Difference]: With dead ends: 815 [2024-10-31 22:08:56,218 INFO L226 Difference]: Without dead ends: 466 [2024-10-31 22:08:56,219 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:08:56,222 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 59 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:08:56,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 900 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:08:56,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-31 22:08:56,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 462. [2024-10-31 22:08:56,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 395 states have (on average 1.2911392405063291) internal successors, (510), 401 states have internal predecessors, (510), 59 states have call successors, (59), 7 states have call predecessors, (59), 7 states have return successors, (59), 53 states have call predecessors, (59), 59 states have call successors, (59) [2024-10-31 22:08:56,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 628 transitions. [2024-10-31 22:08:56,259 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 628 transitions. Word has length 147 [2024-10-31 22:08:56,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:08:56,259 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 628 transitions. [2024-10-31 22:08:56,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.875) internal successors, (55), 9 states have internal predecessors, (55), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-31 22:08:56,260 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 628 transitions. [2024-10-31 22:08:56,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-31 22:08:56,262 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:08:56,262 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:08:56,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:08:56,262 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:08:56,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:08:56,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2118083788, now seen corresponding path program 1 times [2024-10-31 22:08:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:08:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774170208] [2024-10-31 22:08:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:08:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:08:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:08:59,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:08:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:08:59,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:08:59,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:08:59,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:08:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:08:59,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:08:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:08:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:08:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:08:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:08:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:08:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:08:59,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:08:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:08:59,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:08:59,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:08:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:08:59,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:08:59,553 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:08:59,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:08:59,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774170208] [2024-10-31 22:08:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774170208] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:08:59,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:08:59,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:08:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285889545] [2024-10-31 22:08:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:08:59,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:08:59,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:08:59,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:08:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:08:59,556 INFO L87 Difference]: Start difference. First operand 462 states and 628 transitions. Second operand has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-31 22:09:01,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:01,390 INFO L93 Difference]: Finished difference Result 1019 states and 1367 transitions. [2024-10-31 22:09:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-31 22:09:01,391 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) Word has length 147 [2024-10-31 22:09:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:01,394 INFO L225 Difference]: With dead ends: 1019 [2024-10-31 22:09:01,394 INFO L226 Difference]: Without dead ends: 560 [2024-10-31 22:09:01,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:09:01,396 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 159 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:01,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 908 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 835 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-31 22:09:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-10-31 22:09:01,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 471. [2024-10-31 22:09:01,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 399 states have (on average 1.2781954887218046) internal successors, (510), 406 states have internal predecessors, (510), 61 states have call successors, (61), 10 states have call predecessors, (61), 10 states have return successors, (61), 54 states have call predecessors, (61), 61 states have call successors, (61) [2024-10-31 22:09:01,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 632 transitions. [2024-10-31 22:09:01,442 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 632 transitions. Word has length 147 [2024-10-31 22:09:01,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:01,443 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 632 transitions. [2024-10-31 22:09:01,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 6.111111111111111) internal successors, (55), 12 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-31 22:09:01,443 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 632 transitions. [2024-10-31 22:09:01,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-31 22:09:01,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:01,446 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-31 22:09:01,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:09:01,446 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:01,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:01,446 INFO L85 PathProgramCache]: Analyzing trace with hash -697671500, now seen corresponding path program 1 times [2024-10-31 22:09:01,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:01,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888642426] [2024-10-31 22:09:01,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:01,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-31 22:09:03,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-10-31 22:09:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-31 22:09:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-31 22:09:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-31 22:09:03,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-31 22:09:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-31 22:09:03,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-31 22:09:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-31 22:09:03,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-31 22:09:03,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-31 22:09:03,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-31 22:09:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-31 22:09:03,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-31 22:09:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-31 22:09:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-31 22:09:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:03,818 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-31 22:09:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888642426] [2024-10-31 22:09:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888642426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:03,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:09:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410308258] [2024-10-31 22:09:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:03,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:09:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:09:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:09:03,820 INFO L87 Difference]: Start difference. First operand 471 states and 632 transitions. Second operand has 11 states, 8 states have (on average 6.875) internal successors, (55), 11 states have internal predecessors, (55), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 4 states have call successors, (19)