./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/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 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:46:53,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:46:53,661 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:46:53,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:46:53,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:46:53,698 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:46:53,699 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:46:53,700 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:46:53,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:46:53,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:46:53,703 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:46:53,703 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:46:53,704 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:46:53,705 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:46:53,705 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:46:53,706 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:46:53,706 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:46:53,709 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:46:53,710 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:46:53,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:46:53,714 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:46:53,714 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:46:53,715 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:46:53,715 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:46:53,716 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:46:53,716 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:46:53,717 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:46:53,718 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:46:53,718 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:53,719 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:46:53,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:46:53,721 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:46:53,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:46:53,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:46:53,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:46:53,722 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:46:53,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:46:53,722 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:46:53,722 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:46:53,723 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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/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 -> 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 [2023-11-06 22:46:54,089 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:46:54,116 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:46:54,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:46:54,121 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:46:54,122 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:46:54,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-06 22:46:57,553 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:46:57,817 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:46:57,818 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-06 22:46:57,829 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/data/25981bdf8/78bee61e34de4509a8604b9918b2cb54/FLAG7fb032a65 [2023-11-06 22:46:57,846 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/data/25981bdf8/78bee61e34de4509a8604b9918b2cb54 [2023-11-06 22:46:57,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:46:57,850 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:46:57,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:57,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:46:57,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:46:57,862 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:57" (1/1) ... [2023-11-06 22:46:57,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce13680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:57, skipping insertion in model container [2023-11-06 22:46:57,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:46:57" (1/1) ... [2023-11-06 22:46:57,915 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:46:58,141 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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i[917,930] [2023-11-06 22:46:58,253 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:58,273 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:46:58,288 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_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i[917,930] [2023-11-06 22:46:58,346 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:46:58,367 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:46:58,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58 WrapperNode [2023-11-06 22:46:58,367 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:46:58,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:58,369 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:46:58,369 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:46:58,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,394 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,454 INFO L138 Inliner]: procedures = 26, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 390 [2023-11-06 22:46:58,455 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:46:58,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:46:58,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:46:58,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:46:58,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,473 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,507 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:46:58,508 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:46:58,508 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:46:58,508 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:46:58,510 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (1/1) ... [2023-11-06 22:46:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:46:58,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:46:58,558 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:46:58,576 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_40eb20c2-eaaa-4c30-9e60-10e8a6a741f8/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:46:58,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:46:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:46:58,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:46:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:46:58,606 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:46:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:46:58,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:46:58,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:46:58,781 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:46:58,783 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:46:59,394 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:46:59,402 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:46:59,402 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:46:59,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:59 BoogieIcfgContainer [2023-11-06 22:46:59,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:46:59,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:46:59,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:46:59,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:46:59,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:46:57" (1/3) ... [2023-11-06 22:46:59,411 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7c939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:59, skipping insertion in model container [2023-11-06 22:46:59,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:46:58" (2/3) ... [2023-11-06 22:46:59,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7c939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:46:59, skipping insertion in model container [2023-11-06 22:46:59,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:46:59" (3/3) ... [2023-11-06 22:46:59,413 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-06 22:46:59,430 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:46:59,430 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:46:59,480 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:46:59,487 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;@21db173, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:46:59,488 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:46:59,495 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:46:59,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:46:59,510 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:46:59,511 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:46:59,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:46:59,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:46:59,518 INFO L85 PathProgramCache]: Analyzing trace with hash 331903658, now seen corresponding path program 1 times [2023-11-06 22:46:59,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:46:59,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301934231] [2023-11-06 22:46:59,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:46:59,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:46:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:46:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:46:59,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:46:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:46:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:46:59,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:46:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:46:59,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:00,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:00,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,131 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:00,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:00,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301934231] [2023-11-06 22:47:00,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301934231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:00,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:00,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:47:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961064327] [2023-11-06 22:47:00,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:00,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:47:00,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:00,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:47:00,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:47:00,212 INFO L87 Difference]: Start difference. First operand has 99 states, 78 states have (on average 1.3717948717948718) internal successors, (107), 79 states have internal predecessors, (107), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:00,293 INFO L93 Difference]: Finished difference Result 191 states and 298 transitions. [2023-11-06 22:47:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:47:00,296 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2023-11-06 22:47:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:00,311 INFO L225 Difference]: With dead ends: 191 [2023-11-06 22:47:00,312 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:47:00,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 22:47:00,324 INFO L413 NwaCegarLoop]: 132 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, 132 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 22:47:00,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:47:00,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-06 22:47:00,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:47:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 132 transitions. [2023-11-06 22:47:00,413 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 132 transitions. Word has length 129 [2023-11-06 22:47:00,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:00,415 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 132 transitions. [2023-11-06 22:47:00,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 132 transitions. [2023-11-06 22:47:00,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-11-06 22:47:00,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:00,429 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:00,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:47:00,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:00,431 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:00,431 INFO L85 PathProgramCache]: Analyzing trace with hash -718817914, now seen corresponding path program 1 times [2023-11-06 22:47:00,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:00,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691754724] [2023-11-06 22:47:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:00,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:00,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:01,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:01,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:01,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:01,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:01,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:01,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:01,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:01,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691754724] [2023-11-06 22:47:01,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691754724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:01,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:01,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:47:01,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677937022] [2023-11-06 22:47:01,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:01,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:47:01,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:01,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:47:01,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:47:01,211 INFO L87 Difference]: Start difference. First operand 95 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:47:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:01,659 INFO L93 Difference]: Finished difference Result 280 states and 391 transitions. [2023-11-06 22:47:01,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:47:01,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2023-11-06 22:47:01,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:01,673 INFO L225 Difference]: With dead ends: 280 [2023-11-06 22:47:01,674 INFO L226 Difference]: Without dead ends: 188 [2023-11-06 22:47:01,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 22:47:01,686 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 94 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:01,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 301 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:47:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-06 22:47:01,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 157. [2023-11-06 22:47:01,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 118 states have (on average 1.2457627118644068) internal successors, (147), 118 states have internal predecessors, (147), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:47:01,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 219 transitions. [2023-11-06 22:47:01,725 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 219 transitions. Word has length 129 [2023-11-06 22:47:01,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:01,727 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 219 transitions. [2023-11-06 22:47:01,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:47:01,727 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 219 transitions. [2023-11-06 22:47:01,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-06 22:47:01,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:01,730 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:01,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:47:01,730 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:01,731 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:01,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1156097248, now seen corresponding path program 1 times [2023-11-06 22:47:01,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:01,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536984615] [2023-11-06 22:47:01,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:01,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:01,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:03,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:03,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:03,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:03,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:03,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:03,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:04,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:04,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536984615] [2023-11-06 22:47:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536984615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:04,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:04,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-06 22:47:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926094981] [2023-11-06 22:47:04,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:04,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 22:47:04,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:04,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 22:47:04,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:47:04,091 INFO L87 Difference]: Start difference. First operand 157 states and 219 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:05,891 INFO L93 Difference]: Finished difference Result 365 states and 516 transitions. [2023-11-06 22:47:05,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:47:05,893 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2023-11-06 22:47:05,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:05,897 INFO L225 Difference]: With dead ends: 365 [2023-11-06 22:47:05,897 INFO L226 Difference]: Without dead ends: 273 [2023-11-06 22:47:05,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2023-11-06 22:47:05,899 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 569 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:05,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 615 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:47:05,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-06 22:47:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 189. [2023-11-06 22:47:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3) internal successors, (195), 150 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:47:05,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2023-11-06 22:47:05,984 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 137 [2023-11-06 22:47:05,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:05,988 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2023-11-06 22:47:05,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 states have internal predecessors, (50), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:05,989 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2023-11-06 22:47:05,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-06 22:47:05,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:05,994 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:05,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:47:05,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:05,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1242605664, now seen corresponding path program 1 times [2023-11-06 22:47:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:05,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54685499] [2023-11-06 22:47:05,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:08,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:08,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:08,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:08,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:08,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54685499] [2023-11-06 22:47:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54685499] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-06 22:47:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823971097] [2023-11-06 22:47:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:08,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-06 22:47:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-06 22:47:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-06 22:47:08,953 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:10,820 INFO L93 Difference]: Finished difference Result 406 states and 574 transitions. [2023-11-06 22:47:10,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 22:47:10,821 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 138 [2023-11-06 22:47:10,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:10,824 INFO L225 Difference]: With dead ends: 406 [2023-11-06 22:47:10,824 INFO L226 Difference]: Without dead ends: 295 [2023-11-06 22:47:10,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2023-11-06 22:47:10,826 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 570 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:10,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 604 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-06 22:47:10,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-11-06 22:47:10,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 189. [2023-11-06 22:47:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3) internal successors, (195), 150 states have internal predecessors, (195), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-06 22:47:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 267 transitions. [2023-11-06 22:47:10,873 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 267 transitions. Word has length 138 [2023-11-06 22:47:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:10,874 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 267 transitions. [2023-11-06 22:47:10,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-06 22:47:10,874 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 267 transitions. [2023-11-06 22:47:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:47:10,876 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:10,876 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:10,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:47:10,877 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:10,877 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:10,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1038102055, now seen corresponding path program 1 times [2023-11-06 22:47:10,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:10,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628957507] [2023-11-06 22:47:10,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:10,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:10,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:19,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:19,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:19,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:19,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:19,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:19,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628957507] [2023-11-06 22:47:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628957507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:19,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:19,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-06 22:47:19,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721036911] [2023-11-06 22:47:19,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:19,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-06 22:47:19,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:19,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-06 22:47:19,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2023-11-06 22:47:19,662 INFO L87 Difference]: Start difference. First operand 189 states and 267 transitions. Second operand has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:47:34,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:34,994 INFO L93 Difference]: Finished difference Result 655 states and 924 transitions. [2023-11-06 22:47:34,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-06 22:47:34,995 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 139 [2023-11-06 22:47:34,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:35,000 INFO L225 Difference]: With dead ends: 655 [2023-11-06 22:47:35,000 INFO L226 Difference]: Without dead ends: 544 [2023-11-06 22:47:35,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=278, Invalid=1362, Unknown=0, NotChecked=0, Total=1640 [2023-11-06 22:47:35,003 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 562 mSDsluCounter, 2051 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 2265 SdHoareTripleChecker+Invalid, 2738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:35,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 2265 Invalid, 2738 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [34 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-06 22:47:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-11-06 22:47:35,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 338. [2023-11-06 22:47:35,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 280 states have (on average 1.332142857142857) internal successors, (373), 280 states have internal predecessors, (373), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:47:35,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 481 transitions. [2023-11-06 22:47:35,074 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 481 transitions. Word has length 139 [2023-11-06 22:47:35,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:35,074 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 481 transitions. [2023-11-06 22:47:35,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.736842105263158) internal successors, (52), 20 states have internal predecessors, (52), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-06 22:47:35,075 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 481 transitions. [2023-11-06 22:47:35,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:47:35,077 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:35,078 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:35,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:47:35,078 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:35,078 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:35,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1341832277, now seen corresponding path program 1 times [2023-11-06 22:47:35,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:35,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003527955] [2023-11-06 22:47:35,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:35,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:35,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:35,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:35,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:35,312 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:35,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:35,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003527955] [2023-11-06 22:47:35,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003527955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:35,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:35,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:47:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395863328] [2023-11-06 22:47:35,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:35,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:47:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:47:35,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:47:35,316 INFO L87 Difference]: Start difference. First operand 338 states and 481 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:47:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:47:35,410 INFO L93 Difference]: Finished difference Result 600 states and 854 transitions. [2023-11-06 22:47:35,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:47:35,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2023-11-06 22:47:35,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:47:35,416 INFO L225 Difference]: With dead ends: 600 [2023-11-06 22:47:35,416 INFO L226 Difference]: Without dead ends: 362 [2023-11-06 22:47:35,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:47:35,420 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 60 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:47:35,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 485 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:47:35,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2023-11-06 22:47:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 344. [2023-11-06 22:47:35,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 286 states have (on average 1.3251748251748252) internal successors, (379), 286 states have internal predecessors, (379), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:47:35,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 487 transitions. [2023-11-06 22:47:35,496 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 487 transitions. Word has length 139 [2023-11-06 22:47:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:47:35,497 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 487 transitions. [2023-11-06 22:47:35,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-06 22:47:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 487 transitions. [2023-11-06 22:47:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-06 22:47:35,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:47:35,499 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:47:35,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:47:35,500 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:47:35,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:47:35,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1179497433, now seen corresponding path program 1 times [2023-11-06 22:47:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:47:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455624465] [2023-11-06 22:47:35,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:47:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:47:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:47:48,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:47:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:47:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:47:48,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:47:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:47:48,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:47:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-06 22:47:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-06 22:47:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:47:48,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:47:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:47:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:47:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-06 22:47:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-06 22:47:48,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-06 22:47:48,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-06 22:47:48,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-06 22:47:48,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:47:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-06 22:47:48,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:47:48,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455624465] [2023-11-06 22:47:48,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455624465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:47:48,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:47:48,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-06 22:47:48,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042554294] [2023-11-06 22:47:48,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:47:48,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-06 22:47:48,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:47:48,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-06 22:47:48,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2023-11-06 22:47:48,486 INFO L87 Difference]: Start difference. First operand 344 states and 487 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-06 22:48:58,670 WARN L293 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 208 DAG size of output: 198 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:49:12,591 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification. DAG size of input: 145 DAG size of output: 140 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:49:30,716 WARN L293 SmtUtils]: Spent 17.67s on a formula simplification. DAG size of input: 165 DAG size of output: 160 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:49:32,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:49:34,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:01,492 WARN L293 SmtUtils]: Spent 23.80s on a formula simplification. DAG size of input: 193 DAG size of output: 188 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-06 22:50:08,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:19,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:25,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:29,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:33,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:38,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:41,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:44,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:47,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-06 22:50:48,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:50:48,413 INFO L93 Difference]: Finished difference Result 707 states and 979 transitions. [2023-11-06 22:50:48,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:50:48,414 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) Word has length 139 [2023-11-06 22:50:48,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:50:48,418 INFO L225 Difference]: With dead ends: 707 [2023-11-06 22:50:48,418 INFO L226 Difference]: Without dead ends: 593 [2023-11-06 22:50:48,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 181 ImplicationChecksByTransitivity, 132.8s TimeCoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2023-11-06 22:50:48,421 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 821 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1817 mSolverCounterSat, 39 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 49.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 1386 SdHoareTripleChecker+Invalid, 1863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1817 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:50:48,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 1386 Invalid, 1863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1817 Invalid, 7 Unknown, 0 Unchecked, 49.9s Time] [2023-11-06 22:50:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2023-11-06 22:50:48,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 355. [2023-11-06 22:50:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 297 states have (on average 1.3232323232323233) internal successors, (393), 297 states have internal predecessors, (393), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-06 22:50:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 501 transitions. [2023-11-06 22:50:48,492 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 501 transitions. Word has length 139 [2023-11-06 22:50:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:50:48,493 INFO L495 AbstractCegarLoop]: Abstraction has 355 states and 501 transitions. [2023-11-06 22:50:48,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 4 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-06 22:50:48,493 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 501 transitions. [2023-11-06 22:50:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-11-06 22:50:48,495 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:50:48,496 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:50:48,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:50:48,496 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:50:48,497 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:50:48,497 INFO L85 PathProgramCache]: Analyzing trace with hash 543307321, now seen corresponding path program 1 times [2023-11-06 22:50:48,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:50:48,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100976261] [2023-11-06 22:50:48,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:50:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:50:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:50:53,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-06 22:50:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 22:50:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-06 22:50:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-06 22:50:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-06 22:50:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:50:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-06 22:50:53,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat