./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:53:25,232 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:53:25,343 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:53:25,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:53:25,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:53:25,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:53:25,395 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:53:25,396 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:53:25,397 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:53:25,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:53:25,398 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:53:25,399 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:53:25,399 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:53:25,400 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:53:25,401 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:53:25,401 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:53:25,402 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:53:25,403 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:53:25,403 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:53:25,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:53:25,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:53:25,405 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:53:25,406 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:53:25,406 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:53:25,407 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:53:25,407 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:53:25,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:53:25,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:53:25,409 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:25,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:53:25,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:53:25,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:53:25,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:53:25,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:53:25,412 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:53:25,413 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:53:25,413 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:53:25,413 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:53:25,414 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:53:25,414 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_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/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_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a [2023-11-06 21:53:25,697 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:53:25,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:53:25,735 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:53:25,737 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:53:25,737 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:53:25,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:53:28,950 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:53:29,216 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:53:29,218 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:53:29,235 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/9dc2a4e0b/ba177ef137d544888db6e7662fe36ada/FLAGdc7c2fe26 [2023-11-06 21:53:29,252 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/9dc2a4e0b/ba177ef137d544888db6e7662fe36ada [2023-11-06 21:53:29,260 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:53:29,262 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:53:29,264 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,264 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:53:29,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:53:29,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37a6419e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29, skipping insertion in model container [2023-11-06 21:53:29,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,305 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:53:29,464 WARN L240 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_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2023-11-06 21:53:29,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,548 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:53:29,560 WARN L240 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_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2023-11-06 21:53:29,609 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:53:29,646 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:53:29,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29 WrapperNode [2023-11-06 21:53:29,647 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:53:29,648 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,648 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:53:29,648 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:53:29,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,745 INFO L138 Inliner]: procedures = 29, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2023-11-06 21:53:29,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:53:29,746 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,746 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:53:29,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:53:29,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,799 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,806 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,813 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:53:29,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:53:29,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:53:29,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:53:29,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (1/1) ... [2023-11-06 21:53:29,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:53:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:53:29,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:53:29,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:53:29,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:53:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-06 21:53:29,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:53:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-06 21:53:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:53:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-06 21:53:29,933 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:53:29,933 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:53:29,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:53:29,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:53:29,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:53:30,097 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:53:30,102 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:53:30,895 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:53:30,903 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:53:30,904 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:53:30,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30 BoogieIcfgContainer [2023-11-06 21:53:30,906 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:53:30,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:53:30,909 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:53:30,913 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:53:30,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:53:29" (1/3) ... [2023-11-06 21:53:30,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d17624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:53:29" (2/3) ... [2023-11-06 21:53:30,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d17624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:53:30, skipping insertion in model container [2023-11-06 21:53:30,916 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:53:30" (3/3) ... [2023-11-06 21:53:30,917 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:53:30,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:53:30,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:53:30,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:53:30,997 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@a18cb7d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:53:30,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:53:31,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:53:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:31,023 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:31,024 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:31,025 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:31,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,030 INFO L85 PathProgramCache]: Analyzing trace with hash 686700268, now seen corresponding path program 1 times [2023-11-06 21:53:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249959931] [2023-11-06 21:53:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:31,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:31,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:31,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:31,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:31,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:31,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:31,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:31,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:31,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:31,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:31,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:31,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249959931] [2023-11-06 21:53:31,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249959931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:31,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:31,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:53:31,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915008691] [2023-11-06 21:53:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:53:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:31,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:53:31,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,770 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 21:53:31,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:31,826 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2023-11-06 21:53:31,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:53:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 21:53:31,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:31,840 INFO L225 Difference]: With dead ends: 233 [2023-11-06 21:53:31,841 INFO L226 Difference]: Without dead ends: 116 [2023-11-06 21:53:31,853 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:53:31,858 INFO L413 NwaCegarLoop]: 168 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, 168 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 [2023-11-06 21:53:31,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-06 21:53:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-06 21:53:31,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:53:31,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-11-06 21:53:31,930 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2023-11-06 21:53:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:31,931 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-11-06 21:53:31,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 21:53:31,932 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-11-06 21:53:31,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:31,938 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:31,938 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:31,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:53:31,939 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:31,939 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:31,940 INFO L85 PathProgramCache]: Analyzing trace with hash 326820314, now seen corresponding path program 1 times [2023-11-06 21:53:31,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:31,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457355298] [2023-11-06 21:53:31,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:31,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:32,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:32,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:32,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:32,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:32,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:32,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:32,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:32,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:32,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:32,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457355298] [2023-11-06 21:53:32,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457355298] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:32,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:32,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:32,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525520908] [2023-11-06 21:53:32,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:32,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:32,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:32,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:32,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:32,606 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:32,701 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-11-06 21:53:32,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:32,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 21:53:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:32,707 INFO L225 Difference]: With dead ends: 237 [2023-11-06 21:53:32,707 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 21:53:32,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:32,710 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:32,710 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 21:53:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2023-11-06 21:53:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:53:32,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2023-11-06 21:53:32,747 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2023-11-06 21:53:32,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:32,749 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2023-11-06 21:53:32,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:32,750 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2023-11-06 21:53:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:32,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:32,758 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:32,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:53:32,759 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:32,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:32,760 INFO L85 PathProgramCache]: Analyzing trace with hash 2101827676, now seen corresponding path program 1 times [2023-11-06 21:53:32,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:32,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022322769] [2023-11-06 21:53:32,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:33,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:33,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:33,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:33,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:33,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:33,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:33,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:33,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:33,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:33,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:33,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022322769] [2023-11-06 21:53:33,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022322769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:33,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:33,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306080453] [2023-11-06 21:53:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:33,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:33,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:33,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:33,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:33,277 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:33,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:33,345 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2023-11-06 21:53:33,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:53:33,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 21:53:33,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:33,356 INFO L225 Difference]: With dead ends: 237 [2023-11-06 21:53:33,356 INFO L226 Difference]: Without dead ends: 122 [2023-11-06 21:53:33,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:53:33,363 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:33,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 488 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:33,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-06 21:53:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-11-06 21:53:33,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:53:33,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-11-06 21:53:33,386 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2023-11-06 21:53:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:33,387 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-11-06 21:53:33,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-11-06 21:53:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:33,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:33,392 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:33,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:53:33,393 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:33,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash 2103674718, now seen corresponding path program 1 times [2023-11-06 21:53:33,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:33,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782079687] [2023-11-06 21:53:33,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:33,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:33,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:33,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:33,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:33,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:33,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:33,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:33,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782079687] [2023-11-06 21:53:33,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782079687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:33,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:33,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:53:33,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663396689] [2023-11-06 21:53:33,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:33,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:53:33,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:33,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:53:33,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:33,906 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:33,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:33,940 INFO L93 Difference]: Finished difference Result 248 states and 358 transitions. [2023-11-06 21:53:33,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 21:53:33,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 21:53:33,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:33,969 INFO L225 Difference]: With dead ends: 248 [2023-11-06 21:53:33,969 INFO L226 Difference]: Without dead ends: 131 [2023-11-06 21:53:33,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:53:33,971 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 14 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:33,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 21:53:33,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-06 21:53:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-06 21:53:33,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:53:33,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2023-11-06 21:53:33,986 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2023-11-06 21:53:33,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:33,987 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2023-11-06 21:53:33,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:33,987 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2023-11-06 21:53:33,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:33,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:33,991 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:33,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:53:33,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:33,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:33,992 INFO L85 PathProgramCache]: Analyzing trace with hash 180446684, now seen corresponding path program 1 times [2023-11-06 21:53:33,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:33,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027154161] [2023-11-06 21:53:33,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:33,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:37,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:37,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:37,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:37,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:37,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:37,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:37,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:37,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:37,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027154161] [2023-11-06 21:53:37,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027154161] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:37,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:37,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:53:37,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442926969] [2023-11-06 21:53:37,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:37,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:53:37,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:37,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:53:37,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:53:37,641 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:53:38,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:38,461 INFO L93 Difference]: Finished difference Result 260 states and 369 transitions. [2023-11-06 21:53:38,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:53:38,462 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2023-11-06 21:53:38,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:38,465 INFO L225 Difference]: With dead ends: 260 [2023-11-06 21:53:38,465 INFO L226 Difference]: Without dead ends: 141 [2023-11-06 21:53:38,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:53:38,467 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 246 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:38,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 412 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:53:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-06 21:53:38,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2023-11-06 21:53:38,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 105 states have (on average 1.276190476190476) internal successors, (134), 106 states have internal predecessors, (134), 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) [2023-11-06 21:53:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2023-11-06 21:53:38,511 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 190 [2023-11-06 21:53:38,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:38,511 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2023-11-06 21:53:38,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.5) internal successors, (68), 9 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:53:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2023-11-06 21:53:38,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:38,517 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:38,517 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:38,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:53:38,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:38,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash -805089184, now seen corresponding path program 1 times [2023-11-06 21:53:38,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:38,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036687452] [2023-11-06 21:53:38,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:38,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:38,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:44,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:44,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:44,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:44,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:44,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:44,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:44,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:44,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:44,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:44,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:44,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:44,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036687452] [2023-11-06 21:53:44,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036687452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:44,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:44,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 21:53:44,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212216789] [2023-11-06 21:53:44,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:44,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:53:44,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:53:44,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:53:44,518 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:53:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:45,717 INFO L93 Difference]: Finished difference Result 308 states and 436 transitions. [2023-11-06 21:53:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:53:45,717 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2023-11-06 21:53:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:45,721 INFO L225 Difference]: With dead ends: 308 [2023-11-06 21:53:45,721 INFO L226 Difference]: Without dead ends: 187 [2023-11-06 21:53:45,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:53:45,724 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 589 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:45,727 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 369 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 21:53:45,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-11-06 21:53:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 148. [2023-11-06 21:53:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 116 states have (on average 1.3017241379310345) internal successors, (151), 117 states have internal predecessors, (151), 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) [2023-11-06 21:53:45,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 209 transitions. [2023-11-06 21:53:45,781 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 209 transitions. Word has length 190 [2023-11-06 21:53:45,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:45,782 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 209 transitions. [2023-11-06 21:53:45,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.666666666666667) internal successors, (68), 13 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:53:45,782 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 209 transitions. [2023-11-06 21:53:45,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:45,785 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:45,785 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:45,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:53:45,785 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:45,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:45,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1495733406, now seen corresponding path program 1 times [2023-11-06 21:53:45,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:45,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804423126] [2023-11-06 21:53:45,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:45,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:51,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:51,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:51,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:51,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:51,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:52,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:52,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:52,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804423126] [2023-11-06 21:53:52,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804423126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:52,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:52,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 21:53:52,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136792440] [2023-11-06 21:53:52,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:53:52,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:53:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:53:52,021 INFO L87 Difference]: Start difference. First operand 148 states and 209 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:53:54,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:54,189 INFO L93 Difference]: Finished difference Result 405 states and 568 transitions. [2023-11-06 21:53:54,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:53:54,190 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:53:54,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:54,193 INFO L225 Difference]: With dead ends: 405 [2023-11-06 21:53:54,193 INFO L226 Difference]: Without dead ends: 273 [2023-11-06 21:53:54,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2023-11-06 21:53:54,197 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 841 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 841 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 1028 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:54,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [841 Valid, 681 Invalid, 1028 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:53:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-06 21:53:54,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 205. [2023-11-06 21:53:54,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 169 states have (on average 1.3136094674556213) internal successors, (222), 171 states have internal predecessors, (222), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:53:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 284 transitions. [2023-11-06 21:53:54,262 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 284 transitions. Word has length 190 [2023-11-06 21:53:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:54,266 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 284 transitions. [2023-11-06 21:53:54,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:53:54,267 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 284 transitions. [2023-11-06 21:53:54,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:54,269 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:54,270 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:54,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:53:54,270 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:54,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:54,271 INFO L85 PathProgramCache]: Analyzing trace with hash -904232631, now seen corresponding path program 1 times [2023-11-06 21:53:54,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:54,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045710496] [2023-11-06 21:53:54,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:54,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:53:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:53:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:53:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:53:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:53:55,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:53:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:53:55,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:53:55,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:53:55,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:53:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:53:55,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:53:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:53:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:53:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:53:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:53:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:53:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:53:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:53:55,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:53:55,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:53:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:53:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:53:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:53:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:53:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:53:55,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:53:55,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:53:55,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045710496] [2023-11-06 21:53:55,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045710496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:53:55,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:53:55,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:53:55,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117729443] [2023-11-06 21:53:55,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:53:55,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:53:55,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:53:55,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:53:55,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:53:55,135 INFO L87 Difference]: Start difference. First operand 205 states and 284 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:55,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:53:55,579 INFO L93 Difference]: Finished difference Result 531 states and 746 transitions. [2023-11-06 21:53:55,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:53:55,580 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-06 21:53:55,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:53:55,585 INFO L225 Difference]: With dead ends: 531 [2023-11-06 21:53:55,585 INFO L226 Difference]: Without dead ends: 346 [2023-11-06 21:53:55,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:53:55,588 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 295 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:53:55,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 665 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:53:55,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-06 21:53:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 216. [2023-11-06 21:53:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 180 states have (on average 1.3222222222222222) internal successors, (238), 182 states have internal predecessors, (238), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:53:55,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 300 transitions. [2023-11-06 21:53:55,652 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 300 transitions. Word has length 190 [2023-11-06 21:53:55,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:53:55,653 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 300 transitions. [2023-11-06 21:53:55,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-06 21:53:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 300 transitions. [2023-11-06 21:53:55,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:53:55,656 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:53:55,656 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:53:55,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:53:55,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:53:55,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:53:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1396589959, now seen corresponding path program 1 times [2023-11-06 21:53:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:53:55,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837147622] [2023-11-06 21:53:55,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:53:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:53:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:03,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:03,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:03,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:03,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:03,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:03,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:03,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:03,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:03,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:03,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:03,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:03,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:03,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:03,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837147622] [2023-11-06 21:54:03,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837147622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:03,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:03,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-11-06 21:54:03,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062799221] [2023-11-06 21:54:03,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:03,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-06 21:54:03,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-06 21:54:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:54:03,767 INFO L87 Difference]: Start difference. First operand 216 states and 300 transitions. Second operand has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:07,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:07,190 INFO L93 Difference]: Finished difference Result 575 states and 799 transitions. [2023-11-06 21:54:07,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:54:07,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:54:07,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:07,194 INFO L225 Difference]: With dead ends: 575 [2023-11-06 21:54:07,194 INFO L226 Difference]: Without dead ends: 379 [2023-11-06 21:54:07,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2023-11-06 21:54:07,196 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 665 mSDsluCounter, 867 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:07,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 1010 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-06 21:54:07,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-11-06 21:54:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 280. [2023-11-06 21:54:07,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.3565573770491803) internal successors, (331), 246 states have internal predecessors, (331), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2023-11-06 21:54:07,253 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 190 [2023-11-06 21:54:07,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:07,254 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2023-11-06 21:54:07,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 4.533333333333333) internal successors, (68), 17 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2023-11-06 21:54:07,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:07,257 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:07,258 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:07,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:54:07,258 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:07,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1227791010, now seen corresponding path program 1 times [2023-11-06 21:54:07,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:07,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734455746] [2023-11-06 21:54:07,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:07,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:12,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:12,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:12,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:12,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:13,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:13,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:13,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:13,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:13,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:13,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734455746] [2023-11-06 21:54:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734455746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:13,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:13,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-06 21:54:13,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037332196] [2023-11-06 21:54:13,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:13,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-06 21:54:13,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:13,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-06 21:54:13,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:54:13,386 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:14,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:14,829 INFO L93 Difference]: Finished difference Result 599 states and 841 transitions. [2023-11-06 21:54:14,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:14,830 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:54:14,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:14,832 INFO L225 Difference]: With dead ends: 599 [2023-11-06 21:54:14,833 INFO L226 Difference]: Without dead ends: 322 [2023-11-06 21:54:14,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-11-06 21:54:14,834 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 418 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:14,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 414 Invalid, 769 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 21:54:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-06 21:54:14,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 283. [2023-11-06 21:54:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 247 states have (on average 1.3562753036437247) internal successors, (335), 249 states have internal predecessors, (335), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:14,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 397 transitions. [2023-11-06 21:54:14,890 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 397 transitions. Word has length 190 [2023-11-06 21:54:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:14,891 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 397 transitions. [2023-11-06 21:54:14,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.857142857142857) internal successors, (68), 15 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 397 transitions. [2023-11-06 21:54:14,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:14,895 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:14,895 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:14,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:54:14,895 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:14,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:14,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1073031580, now seen corresponding path program 1 times [2023-11-06 21:54:14,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:14,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568500969] [2023-11-06 21:54:14,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:14,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:20,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:20,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:20,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:20,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:20,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:20,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:20,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568500969] [2023-11-06 21:54:20,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568500969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:20,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:20,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-06 21:54:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201858276] [2023-11-06 21:54:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:20,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-06 21:54:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:20,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-06 21:54:20,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:54:20,734 INFO L87 Difference]: Start difference. First operand 283 states and 397 transitions. Second operand has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:54:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:22,883 INFO L93 Difference]: Finished difference Result 810 states and 1133 transitions. [2023-11-06 21:54:22,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:54:22,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) Word has length 190 [2023-11-06 21:54:22,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:22,889 INFO L225 Difference]: With dead ends: 810 [2023-11-06 21:54:22,889 INFO L226 Difference]: Without dead ends: 530 [2023-11-06 21:54:22,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2023-11-06 21:54:22,892 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 972 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:22,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 669 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-06 21:54:22,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-11-06 21:54:22,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 282. [2023-11-06 21:54:22,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 246 states have (on average 1.3577235772357723) internal successors, (334), 248 states have internal predecessors, (334), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:22,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 396 transitions. [2023-11-06 21:54:22,956 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 396 transitions. Word has length 190 [2023-11-06 21:54:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:22,956 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 396 transitions. [2023-11-06 21:54:22,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.533333333333333) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 3 states have call successors, (25) [2023-11-06 21:54:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 396 transitions. [2023-11-06 21:54:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:22,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:22,959 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:22,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:54:22,959 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:22,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:22,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1326934457, now seen corresponding path program 1 times [2023-11-06 21:54:22,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:22,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989019488] [2023-11-06 21:54:22,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:23,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:23,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:24,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:24,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:24,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:24,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:24,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989019488] [2023-11-06 21:54:24,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989019488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:24,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:24,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-06 21:54:24,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647692314] [2023-11-06 21:54:24,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:24,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-06 21:54:24,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:24,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-06 21:54:24,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-06 21:54:24,073 INFO L87 Difference]: Start difference. First operand 282 states and 396 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 21:54:24,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:24,667 INFO L93 Difference]: Finished difference Result 767 states and 1078 transitions. [2023-11-06 21:54:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:54:24,668 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-06 21:54:24,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:24,672 INFO L225 Difference]: With dead ends: 767 [2023-11-06 21:54:24,672 INFO L226 Difference]: Without dead ends: 488 [2023-11-06 21:54:24,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:54:24,674 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 500 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:24,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 550 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:54:24,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-11-06 21:54:24,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 280. [2023-11-06 21:54:24,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 244 states have (on average 1.3565573770491803) internal successors, (331), 246 states have internal predecessors, (331), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:24,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 393 transitions. [2023-11-06 21:54:24,739 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 393 transitions. Word has length 190 [2023-11-06 21:54:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 393 transitions. [2023-11-06 21:54:24,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-06 21:54:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 393 transitions. [2023-11-06 21:54:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:24,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:24,743 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:24,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:54:24,744 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:24,744 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:24,744 INFO L85 PathProgramCache]: Analyzing trace with hash 973888133, now seen corresponding path program 1 times [2023-11-06 21:54:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725461701] [2023-11-06 21:54:24,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:32,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:32,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:32,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:32,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:32,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:32,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:32,446 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:32,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:32,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725461701] [2023-11-06 21:54:32,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725461701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:32,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:32,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-06 21:54:32,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198421137] [2023-11-06 21:54:32,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:32,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:54:32,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:32,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:54:32,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:54:32,449 INFO L87 Difference]: Start difference. First operand 280 states and 393 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:37,052 INFO L93 Difference]: Finished difference Result 770 states and 1069 transitions. [2023-11-06 21:54:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 21:54:37,053 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:54:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:37,057 INFO L225 Difference]: With dead ends: 770 [2023-11-06 21:54:37,057 INFO L226 Difference]: Without dead ends: 493 [2023-11-06 21:54:37,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=310, Invalid=880, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 21:54:37,060 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 1465 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 1263 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:37,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 866 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1263 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-06 21:54:37,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2023-11-06 21:54:37,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 283. [2023-11-06 21:54:37,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 247 states have (on average 1.360323886639676) internal successors, (336), 249 states have internal predecessors, (336), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:37,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 398 transitions. [2023-11-06 21:54:37,133 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 398 transitions. Word has length 190 [2023-11-06 21:54:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:37,134 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 398 transitions. [2023-11-06 21:54:37,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 398 transitions. [2023-11-06 21:54:37,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:37,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:37,136 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:37,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:54:37,137 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:37,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:37,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719900, now seen corresponding path program 1 times [2023-11-06 21:54:37,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:37,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506427092] [2023-11-06 21:54:37,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:37,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:43,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:43,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:43,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:43,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:43,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:43,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:43,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:43,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:43,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506427092] [2023-11-06 21:54:43,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506427092] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:43,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:43,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-06 21:54:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813659323] [2023-11-06 21:54:43,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:43,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:54:43,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:43,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:54:43,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:54:43,874 INFO L87 Difference]: Start difference. First operand 283 states and 398 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:54:47,004 INFO L93 Difference]: Finished difference Result 654 states and 913 transitions. [2023-11-06 21:54:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:54:47,005 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:54:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:54:47,008 INFO L225 Difference]: With dead ends: 654 [2023-11-06 21:54:47,008 INFO L226 Difference]: Without dead ends: 374 [2023-11-06 21:54:47,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2023-11-06 21:54:47,010 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 825 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 827 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:54:47,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [827 Valid, 882 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-06 21:54:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-11-06 21:54:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 281. [2023-11-06 21:54:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.3591836734693878) internal successors, (333), 247 states have internal predecessors, (333), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:54:47,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 395 transitions. [2023-11-06 21:54:47,084 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 395 transitions. Word has length 190 [2023-11-06 21:54:47,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:54:47,085 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 395 transitions. [2023-11-06 21:54:47,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:54:47,085 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 395 transitions. [2023-11-06 21:54:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:54:47,113 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:54:47,113 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:47,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:54:47,113 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:54:47,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:47,114 INFO L85 PathProgramCache]: Analyzing trace with hash 939018074, now seen corresponding path program 1 times [2023-11-06 21:54:47,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:47,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001948248] [2023-11-06 21:54:47,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:47,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:47,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:54:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:54:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:54:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:54:55,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:54:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:54:55,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:54:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:54:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:54:55,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:54:55,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:54:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:54:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:54:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:54:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:54:55,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:54:55,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:54:55,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:54:55,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:54:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:54:55,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:54:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:54:55,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:54:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:54:55,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:54:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:55,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:54:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001948248] [2023-11-06 21:54:55,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001948248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:55,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:55,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-06 21:54:55,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117656097] [2023-11-06 21:54:55,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:55,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 21:54:55,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:55,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 21:54:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2023-11-06 21:54:55,682 INFO L87 Difference]: Start difference. First operand 281 states and 395 transitions. Second operand has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 20 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-06 21:55:01,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:01,315 INFO L93 Difference]: Finished difference Result 716 states and 998 transitions. [2023-11-06 21:55:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 21:55:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 20 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) Word has length 190 [2023-11-06 21:55:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:01,319 INFO L225 Difference]: With dead ends: 716 [2023-11-06 21:55:01,319 INFO L226 Difference]: Without dead ends: 438 [2023-11-06 21:55:01,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=360, Invalid=1200, Unknown=0, NotChecked=0, Total=1560 [2023-11-06 21:55:01,322 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 1099 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 1550 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 970 SdHoareTripleChecker+Invalid, 1641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:01,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 970 Invalid, 1641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1550 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-06 21:55:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2023-11-06 21:55:01,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 281. [2023-11-06 21:55:01,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.3591836734693878) internal successors, (333), 247 states have internal predecessors, (333), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:55:01,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 395 transitions. [2023-11-06 21:55:01,390 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 395 transitions. Word has length 190 [2023-11-06 21:55:01,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:01,391 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 395 transitions. [2023-11-06 21:55:01,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 20 states have internal predecessors, (68), 5 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2023-11-06 21:55:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 395 transitions. [2023-11-06 21:55:01,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:55:01,393 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:01,393 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:01,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:55:01,394 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:01,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:01,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1460947963, now seen corresponding path program 1 times [2023-11-06 21:55:01,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:01,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075837577] [2023-11-06 21:55:01,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:01,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:08,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:08,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:08,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:08,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:55:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:55:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:08,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:55:08,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:55:08,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-06 21:55:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:08,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075837577] [2023-11-06 21:55:08,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075837577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:08,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:08,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-11-06 21:55:08,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14328141] [2023-11-06 21:55:08,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:08,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-06 21:55:08,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:08,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-06 21:55:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2023-11-06 21:55:08,636 INFO L87 Difference]: Start difference. First operand 281 states and 395 transitions. Second operand has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:55:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:13,379 INFO L93 Difference]: Finished difference Result 713 states and 994 transitions. [2023-11-06 21:55:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 21:55:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) Word has length 190 [2023-11-06 21:55:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:13,385 INFO L225 Difference]: With dead ends: 713 [2023-11-06 21:55:13,385 INFO L226 Difference]: Without dead ends: 435 [2023-11-06 21:55:13,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2023-11-06 21:55:13,388 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 829 mSDsluCounter, 1056 mSDsCounter, 0 mSdLazyCounter, 1677 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1198 SdHoareTripleChecker+Invalid, 1753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 1677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:13,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1198 Invalid, 1753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 1677 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-06 21:55:13,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2023-11-06 21:55:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 275. [2023-11-06 21:55:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 239 states have (on average 1.3514644351464435) internal successors, (323), 241 states have internal predecessors, (323), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 29 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-06 21:55:13,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 385 transitions. [2023-11-06 21:55:13,471 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 385 transitions. Word has length 190 [2023-11-06 21:55:13,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:13,472 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 385 transitions. [2023-11-06 21:55:13,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 4.25) internal successors, (68), 18 states have internal predecessors, (68), 4 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 4 states have call successors, (25) [2023-11-06 21:55:13,472 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 385 transitions. [2023-11-06 21:55:13,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:55:13,474 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:13,475 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:13,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:55:13,475 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:13,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:13,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1566650078, now seen corresponding path program 1 times [2023-11-06 21:55:13,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:13,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353769726] [2023-11-06 21:55:13,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:13,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:17,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:17,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:17,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:17,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:17,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:17,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:55:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:55:17,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:17,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:55:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:55:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 69 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 21:55:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353769726] [2023-11-06 21:55:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353769726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:17,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856778410] [2023-11-06 21:55:17,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:17,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:17,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:55:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,848 INFO L262 TraceCheckSpWp]: Trace formula consists of 662 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-06 21:55:17,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:18,134 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:55:18,403 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:18,522 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:18,649 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:18,773 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:18,895 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,181 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,324 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,463 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,588 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:19,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-06 21:55:19,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 335 proven. 153 refuted. 0 times theorem prover too weak. 712 trivial. 0 not checked. [2023-11-06 21:55:19,704 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:19,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856778410] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:19,873 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:19,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8] total 21 [2023-11-06 21:55:19,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497296122] [2023-11-06 21:55:19,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:19,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-06 21:55:19,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:19,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-06 21:55:19,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2023-11-06 21:55:19,877 INFO L87 Difference]: Start difference. First operand 275 states and 385 transitions. Second operand has 21 states, 19 states have (on average 6.894736842105263) internal successors, (131), 21 states have internal predecessors, (131), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2023-11-06 21:55:22,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:55:22,883 INFO L93 Difference]: Finished difference Result 602 states and 830 transitions. [2023-11-06 21:55:22,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 21:55:22,884 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 6.894736842105263) internal successors, (131), 21 states have internal predecessors, (131), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) Word has length 190 [2023-11-06 21:55:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:55:22,887 INFO L225 Difference]: With dead ends: 602 [2023-11-06 21:55:22,887 INFO L226 Difference]: Without dead ends: 330 [2023-11-06 21:55:22,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=347, Invalid=1293, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 21:55:22,889 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 368 mSDsluCounter, 616 mSDsCounter, 0 mSdLazyCounter, 1269 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 1346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:55:22,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 689 Invalid, 1346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1269 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-06 21:55:22,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2023-11-06 21:55:22,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 176. [2023-11-06 21:55:22,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 141 states have (on average 1.297872340425532) internal successors, (183), 142 states have internal predecessors, (183), 29 states have call successors, (29), 5 states have call predecessors, (29), 5 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-06 21:55:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 241 transitions. [2023-11-06 21:55:22,961 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 241 transitions. Word has length 190 [2023-11-06 21:55:22,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:55:22,962 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 241 transitions. [2023-11-06 21:55:22,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 6.894736842105263) internal successors, (131), 21 states have internal predecessors, (131), 8 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (50), 6 states have call predecessors, (50), 8 states have call successors, (50) [2023-11-06 21:55:22,962 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 241 transitions. [2023-11-06 21:55:22,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-11-06 21:55:22,964 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:22,964 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:22,977 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:23,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 21:55:23,172 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:23,172 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:23,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1268244171, now seen corresponding path program 1 times [2023-11-06 21:55:23,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:23,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310517971] [2023-11-06 21:55:23,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:23,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 21:55:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 21:55:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:55:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 21:55:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 21:55:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 21:55:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 21:55:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 21:55:27,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 21:55:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 21:55:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 21:55:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 21:55:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 21:55:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 21:55:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 21:55:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 21:55:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 21:55:27,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 21:55:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-06 21:55:27,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-06 21:55:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-06 21:55:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-06 21:55:27,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-06 21:55:27,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-06 21:55:27,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-06 21:55:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2023-11-06 21:55:27,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:27,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310517971] [2023-11-06 21:55:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310517971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852739360] [2023-11-06 21:55:27,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:27,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:27,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:27,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:27,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:55:27,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:27,870 INFO L262 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-06 21:55:27,910 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:29,283 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:55:30,225 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:31,153 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:32,082 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:33,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:34,045 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:34,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:35,791 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:36,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:37,497 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:38,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:39,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:39,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:39,907 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-06 21:55:40,240 INFO L322 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2023-11-06 21:55:40,241 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 68 [2023-11-06 21:55:40,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:40,318 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 71 [2023-11-06 21:55:40,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:40,451 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 20 [2023-11-06 21:55:40,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:55:40,554 INFO L322 Elim1Store]: treesize reduction 86, result has 23.9 percent of original size [2023-11-06 21:55:40,554 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 51 treesize of output 89 [2023-11-06 21:55:41,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 121 [2023-11-06 21:55:49,583 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2023-11-06 21:55:49,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:49,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 21:55:49,791 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Unexpected substitution problem. at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:227) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:190) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:124) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:93) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:88) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:543) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:522) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:515) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:189) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:100) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:84) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:297) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:283) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:51) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:184) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-11-06 21:55:49,795 INFO L158 Benchmark]: Toolchain (without parser) took 140532.99ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 137.4MB in the beginning and 952.0MB in the end (delta: -814.6MB). Peak memory consumption was 696.8MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,795 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:55:49,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.22ms. Allocated memory is still 180.4MB. Free memory was 137.4MB in the beginning and 120.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,796 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.74ms. Allocated memory is still 180.4MB. Free memory was 120.0MB in the beginning and 115.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,797 INFO L158 Benchmark]: Boogie Preprocessor took 67.11ms. Allocated memory is still 180.4MB. Free memory was 115.4MB in the beginning and 112.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,797 INFO L158 Benchmark]: RCFGBuilder took 1092.46ms. Allocated memory is still 180.4MB. Free memory was 112.2MB in the beginning and 127.4MB in the end (delta: -15.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,798 INFO L158 Benchmark]: TraceAbstraction took 138885.55ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 126.3MB in the beginning and 952.0MB in the end (delta: -825.7MB). Peak memory consumption was 687.3MB. Max. memory is 16.1GB. [2023-11-06 21:55:49,799 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 107.0MB. Free memory is still 56.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.22ms. Allocated memory is still 180.4MB. Free memory was 137.4MB in the beginning and 120.0MB in the end (delta: 17.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.74ms. Allocated memory is still 180.4MB. Free memory was 120.0MB in the beginning and 115.4MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.11ms. Allocated memory is still 180.4MB. Free memory was 115.4MB in the beginning and 112.2MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1092.46ms. Allocated memory is still 180.4MB. Free memory was 112.2MB in the beginning and 127.4MB in the end (delta: -15.2MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * TraceAbstraction took 138885.55ms. Allocated memory was 180.4MB in the beginning and 1.2GB in the end (delta: 996.1MB). Free memory was 126.3MB in the beginning and 952.0MB in the end (delta: -825.7MB). Peak memory consumption was 687.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Unexpected substitution problem. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Unexpected substitution problem.: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1(Elim1Store.java:305) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:55:49,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:55:52,617 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:55:52,737 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-06 21:55:52,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:55:52,749 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:55:52,805 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:55:52,806 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:55:52,807 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:55:52,809 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:55:52,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:55:52,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:55:52,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:55:52,817 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:55:52,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:55:52,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:55:52,821 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:55:52,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:55:52,822 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:55:52,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:55:52,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:55:52,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:55:52,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 21:55:52,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 21:55:52,827 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 21:55:52,828 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:55:52,828 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:55:52,829 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:55:52,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:55:52,830 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:55:52,831 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:55:52,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:52,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:55:52,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:55:52,834 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:55:52,835 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 21:55:52,835 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 21:55:52,836 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:55:52,836 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:55:52,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:55:52,838 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:55:52,839 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 21:55:52,840 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:55:52,840 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_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/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_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> c6dac1e5238ed53a380160bb79ff5b6b2442b7be93876c5524c1d6a035c6da2a [2023-11-06 21:55:53,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:55:53,374 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:55:53,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:55:53,380 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:55:53,380 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:55:53,382 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:55:56,609 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:55:56,958 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:55:56,959 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:55:56,971 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/88ffcbd1c/f824ebf64e8e46bbb88435be99f9315f/FLAGca7387071 [2023-11-06 21:55:56,989 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/data/88ffcbd1c/f824ebf64e8e46bbb88435be99f9315f [2023-11-06 21:55:56,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:55:56,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:55:56,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:56,996 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:55:57,002 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:55:57,003 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:56" (1/1) ... [2023-11-06 21:55:57,005 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ee137d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57, skipping insertion in model container [2023-11-06 21:55:57,005 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:55:56" (1/1) ... [2023-11-06 21:55:57,048 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:55:57,255 WARN L240 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_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2023-11-06 21:55:57,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:57,406 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:55:57,426 WARN L240 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_31d7c414-2312-4745-9031-111cb557a98f/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-61.i[917,930] [2023-11-06 21:55:57,491 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:55:57,519 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:55:57,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57 WrapperNode [2023-11-06 21:55:57,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:55:57,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:57,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:55:57,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:55:57,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,559 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,629 INFO L138 Inliner]: procedures = 36, calls = 184, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 464 [2023-11-06 21:55:57,634 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:55:57,634 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:55:57,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:55:57,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:55:57,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,651 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,667 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,694 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,732 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,769 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:55:57,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:55:57,777 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:55:57,777 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:55:57,778 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (1/1) ... [2023-11-06 21:55:57,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:55:57,802 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:57,818 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:55:57,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:55:57,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:55:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2023-11-06 21:55:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2023-11-06 21:55:57,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-11-06 21:55:57,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2023-11-06 21:55:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 21:55:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2023-11-06 21:55:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2023-11-06 21:55:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2023-11-06 21:55:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2023-11-06 21:55:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2023-11-06 21:55:57,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 21:55:57,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 21:55:57,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:55:57,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:55:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2023-11-06 21:55:57,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2023-11-06 21:55:58,108 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:55:58,111 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:55:59,700 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:55:59,710 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:55:59,710 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 21:55:59,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:59 BoogieIcfgContainer [2023-11-06 21:55:59,713 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:55:59,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:55:59,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:55:59,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:55:59,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:55:56" (1/3) ... [2023-11-06 21:55:59,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215b234f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:59, skipping insertion in model container [2023-11-06 21:55:59,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:55:57" (2/3) ... [2023-11-06 21:55:59,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@215b234f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:55:59, skipping insertion in model container [2023-11-06 21:55:59,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:55:59" (3/3) ... [2023-11-06 21:55:59,723 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-61.i [2023-11-06 21:55:59,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:55:59,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:55:59,798 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:55:59,806 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3a7e8008, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:55:59,807 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 21:55:59,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-06 21:55:59,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-06 21:55:59,837 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:55:59,839 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:59,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 21:55:59,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1439989331, now seen corresponding path program 1 times [2023-11-06 21:55:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 21:55:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11921126] [2023-11-06 21:55:59,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:59,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:55:59,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 21:55:59,873 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 21:55:59,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 21:56:00,421 ERROR L418 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Exception during sending of exit command (exit): Broken pipe [2023-11-06 21:56:00,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 139 [2023-11-06 21:56:00,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 21:56:00,622 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.AnnotateAndAsserter.buildAnnotatedSsaAndAssertTerms(AnnotateAndAsserter.java:130) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.checkTrace(TraceCheck.java:317) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:215) ... 30 more Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 37 more [2023-11-06 21:56:00,627 INFO L158 Benchmark]: Toolchain (without parser) took 3632.50ms. Allocated memory is still 102.8MB. Free memory was 78.4MB in the beginning and 45.8MB in the end (delta: 32.6MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,628 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:56:00,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 524.66ms. Allocated memory is still 102.8MB. Free memory was 78.4MB in the beginning and 60.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.86ms. Allocated memory is still 102.8MB. Free memory was 60.3MB in the beginning and 81.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,631 INFO L158 Benchmark]: Boogie Preprocessor took 141.20ms. Allocated memory is still 102.8MB. Free memory was 81.2MB in the beginning and 77.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,632 INFO L158 Benchmark]: RCFGBuilder took 1936.97ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,632 INFO L158 Benchmark]: TraceAbstraction took 909.77ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 45.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2023-11-06 21:56:00,636 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38ms. Allocated memory is still 73.4MB. Free memory was 49.6MB in the beginning and 49.5MB in the end (delta: 92.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 524.66ms. Allocated memory is still 102.8MB. Free memory was 78.4MB in the beginning and 60.3MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.86ms. Allocated memory is still 102.8MB. Free memory was 60.3MB in the beginning and 81.2MB in the end (delta: -20.9MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 141.20ms. Allocated memory is still 102.8MB. Free memory was 81.2MB in the beginning and 77.8MB in the end (delta: 3.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1936.97ms. Allocated memory is still 102.8MB. Free memory was 77.4MB in the beginning and 75.3MB in the end (delta: 2.2MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. * TraceAbstraction took 909.77ms. Allocated memory is still 102.8MB. Free memory was 74.2MB in the beginning and 45.8MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.: de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2023-11-06 21:56:00,682 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31d7c414-2312-4745-9031-111cb557a98f/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2) with exit command (exit)) Received EOF on stdin. No stderr output.