./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19cc8c12b97d00c18bd753d2c40678eb07734cfb5a01e7b7c6c980ae83e69a6f --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:58:28,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:58:28,580 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:58:28,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:58:28,591 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:58:28,631 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:58:28,634 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:58:28,635 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:58:28,636 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:58:28,638 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:58:28,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:58:28,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:58:28,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:58:28,642 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:58:28,642 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:58:28,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:58:28,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:58:28,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:58:28,648 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:58:28,648 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:58:28,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:58:28,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:58:28,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:58:28,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:58:28,651 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:58:28,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:58:28,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:58:28,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:58:28,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:58:28,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:58:28,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:58:28,654 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:58:28,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:28,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:58:28,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:58:28,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:58:28,656 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:58:28,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:58:28,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:58:28,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:58:28,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:58:28,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:58:28,659 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_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 19cc8c12b97d00c18bd753d2c40678eb07734cfb5a01e7b7c6c980ae83e69a6f [2024-10-31 21:58:29,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:58:29,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:58:29,050 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:58:29,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:58:29,056 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:58:29,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i Unable to find full path for "g++" [2024-10-31 21:58:31,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:58:31,584 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:58:31,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i [2024-10-31 21:58:31,596 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/data/69517ce48/7826ab922ef444d5ae921982295e60b8/FLAG652126040 [2024-10-31 21:58:31,921 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/data/69517ce48/7826ab922ef444d5ae921982295e60b8 [2024-10-31 21:58:31,924 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:58:31,926 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:58:31,927 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:31,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:58:31,935 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:58:31,936 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:31" (1/1) ... [2024-10-31 21:58:31,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bcdf6ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:31, skipping insertion in model container [2024-10-31 21:58:31,938 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:58:31" (1/1) ... [2024-10-31 21:58:31,973 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:58:32,209 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i[919,932] [2024-10-31 21:58:32,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:32,340 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:58:32,354 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i[919,932] [2024-10-31 21:58:32,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:58:32,444 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:58:32,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32 WrapperNode [2024-10-31 21:58:32,446 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:58:32,447 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:32,448 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:58:32,448 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:58:32,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,541 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 232 [2024-10-31 21:58:32,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:58:32,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:58:32,543 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:58:32,543 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:58:32,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,576 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,633 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 21:58:32,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,699 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,719 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,727 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:58:32,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:58:32,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:58:32,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:58:32,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (1/1) ... [2024-10-31 21:58:32,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:58:32,776 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:58:32,798 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:58:32,805 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4e05e651-1632-4fcd-877d-d5b1eb4e6ba1/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:58:32,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:58:32,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:58:32,843 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:58:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:58:32,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:58:32,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:58:32,996 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:58:33,001 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:58:33,622 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-10-31 21:58:33,622 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:58:33,645 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:58:33,646 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:58:33,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:33 BoogieIcfgContainer [2024-10-31 21:58:33,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:58:33,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:58:33,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:58:33,655 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:58:33,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:58:31" (1/3) ... [2024-10-31 21:58:33,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16017b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:33, skipping insertion in model container [2024-10-31 21:58:33,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:58:32" (2/3) ... [2024-10-31 21:58:33,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16017b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:58:33, skipping insertion in model container [2024-10-31 21:58:33,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:58:33" (3/3) ... [2024-10-31 21:58:33,661 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-28.i [2024-10-31 21:58:33,686 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:58:33,687 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:58:33,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:58:33,798 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@40f9b49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:58:33,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:58:33,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-31 21:58:33,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-31 21:58:33,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:33,827 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:33,829 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:33,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:33,837 INFO L85 PathProgramCache]: Analyzing trace with hash -2046951551, now seen corresponding path program 1 times [2024-10-31 21:58:33,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:33,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201093482] [2024-10-31 21:58:33,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:33,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:34,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:34,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:58:34,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:58:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:58:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:58:34,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:58:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:58:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:58:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 21:58:34,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-31 21:58:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 21:58:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-31 21:58:34,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:34,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201093482] [2024-10-31 21:58:34,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201093482] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:34,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:34,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:58:34,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117458218] [2024-10-31 21:58:34,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:34,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:58:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:34,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:58:34,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:58:34,663 INFO L87 Difference]: Start difference. First operand has 99 states, 70 states have (on average 1.457142857142857) internal successors, (102), 71 states have internal predecessors, (102), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-31 21:58:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:34,714 INFO L93 Difference]: Finished difference Result 191 states and 328 transitions. [2024-10-31 21:58:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:58:34,719 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 176 [2024-10-31 21:58:34,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:34,729 INFO L225 Difference]: With dead ends: 191 [2024-10-31 21:58:34,730 INFO L226 Difference]: Without dead ends: 95 [2024-10-31 21:58:34,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:58:34,742 INFO L432 NwaCegarLoop]: 147 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, 147 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:34,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-10-31 21:58:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-10-31 21:58:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.4179104477611941) internal successors, (95), 67 states have internal predecessors, (95), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-31 21:58:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 147 transitions. [2024-10-31 21:58:34,796 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 147 transitions. Word has length 176 [2024-10-31 21:58:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:34,796 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 147 transitions. [2024-10-31 21:58:34,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-31 21:58:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 147 transitions. [2024-10-31 21:58:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-31 21:58:34,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:34,802 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:34,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:58:34,803 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:34,804 INFO L85 PathProgramCache]: Analyzing trace with hash -597272007, now seen corresponding path program 1 times [2024-10-31 21:58:34,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107344769] [2024-10-31 21:58:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:34,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:35,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:35,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:35,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:35,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:58:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:58:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:58:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:58:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:58:35,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:58:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:58:35,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 21:58:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-31 21:58:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 21:58:35,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-31 21:58:35,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:35,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107344769] [2024-10-31 21:58:35,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107344769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:35,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:35,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:58:35,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279909041] [2024-10-31 21:58:35,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:35,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:58:35,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:58:35,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:35,378 INFO L87 Difference]: Start difference. First operand 95 states and 147 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-31 21:58:35,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:35,433 INFO L93 Difference]: Finished difference Result 188 states and 293 transitions. [2024-10-31 21:58:35,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:58:35,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-10-31 21:58:35,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:35,439 INFO L225 Difference]: With dead ends: 188 [2024-10-31 21:58:35,440 INFO L226 Difference]: Without dead ends: 96 [2024-10-31 21:58:35,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:58:35,444 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:35,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 286 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:58:35,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-31 21:58:35,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-10-31 21:58:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-31 21:58:35,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 148 transitions. [2024-10-31 21:58:35,472 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 148 transitions. Word has length 176 [2024-10-31 21:58:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:35,474 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 148 transitions. [2024-10-31 21:58:35,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-31 21:58:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 148 transitions. [2024-10-31 21:58:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-31 21:58:35,482 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:35,482 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:35,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:58:35,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:35,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:35,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1703550583, now seen corresponding path program 1 times [2024-10-31 21:58:35,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:35,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726926537] [2024-10-31 21:58:35,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:35,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:58:40,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:58:40,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:58:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:58:40,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:58:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:58:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:58:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:58:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:58:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:58:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:58:40,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 21:58:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 21:58:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 21:58:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 21:58:40,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 21:58:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-31 21:58:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 21:58:40,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-31 21:58:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-31 21:58:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-31 21:58:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-31 21:58:40,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-31 21:58:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-10-31 21:58:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-10-31 21:58:40,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-31 21:58:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:58:40,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-31 21:58:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:58:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726926537] [2024-10-31 21:58:40,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726926537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:58:40,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:58:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 21:58:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604520320] [2024-10-31 21:58:40,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:58:40,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:58:40,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:58:40,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:58:40,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 21:58:40,346 INFO L87 Difference]: Start difference. First operand 96 states and 148 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-31 21:58:41,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:58:41,510 INFO L93 Difference]: Finished difference Result 438 states and 662 transitions. [2024-10-31 21:58:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:58:41,511 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 176 [2024-10-31 21:58:41,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:58:41,516 INFO L225 Difference]: With dead ends: 438 [2024-10-31 21:58:41,516 INFO L226 Difference]: Without dead ends: 345 [2024-10-31 21:58:41,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-31 21:58:41,519 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 632 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-31 21:58:41,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 719 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-31 21:58:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-31 21:58:41,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 288. [2024-10-31 21:58:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 220 states have (on average 1.4227272727272726) internal successors, (313), 223 states have internal predecessors, (313), 62 states have call successors, (62), 5 states have call predecessors, (62), 5 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-31 21:58:41,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 437 transitions. [2024-10-31 21:58:41,600 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 437 transitions. Word has length 176 [2024-10-31 21:58:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:58:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 437 transitions. [2024-10-31 21:58:41,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-31 21:58:41,604 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 437 transitions. [2024-10-31 21:58:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-10-31 21:58:41,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:58:41,612 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:58:41,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:58:41,613 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:58:41,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:58:41,614 INFO L85 PathProgramCache]: Analyzing trace with hash 423686905, now seen corresponding path program 1 times [2024-10-31 21:58:41,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:58:41,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495339026] [2024-10-31 21:58:41,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:58:41,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:58:41,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat